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/heap-data/running_example.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 02:01:54,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 02:01:54,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 02:01:54,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 02:01:54,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 02:01:54,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 02:01:54,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 02:01:54,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 02:01:54,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 02:01:54,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 02:01:54,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 02:01:54,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 02:01:54,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 02:01:54,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 02:01:54,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 02:01:54,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 02:01:54,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 02:01:54,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 02:01:54,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 02:01:54,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 02:01:54,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 02:01:54,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 02:01:54,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 02:01:54,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 02:01:54,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 02:01:54,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 02:01:54,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 02:01:54,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 02:01:54,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 02:01:54,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 02:01:54,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 02:01:54,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 02:01:54,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 02:01:54,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 02:01:54,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 02:01:54,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 02:01:54,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 02:01:54,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 02:01:54,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 02:01:54,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 02:01:54,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 02:01:54,173 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 02:01:54,196 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 02:01:54,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 02:01:54,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 02:01:54,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 02:01:54,198 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 02:01:54,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 02:01:54,199 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 02:01:54,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 02:01:54,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 02:01:54,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 02:01:54,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 02:01:54,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 02:01:54,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 02:01:54,200 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 02:01:54,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 02:01:54,200 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 02:01:54,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 02:01:54,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 02:01:54,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 02:01:54,202 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 02:01:54,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 02:01:54,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 02:01:54,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 02:01:54,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 02:01:54,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 02:01:54,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 02:01:54,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 02:01:54,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 02:01:54,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 02:01:54,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 02:01:54,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 02:01:54,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 02:01:54,263 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 02:01:54,263 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 02:01:54,264 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/running_example.i [2019-10-02 02:01:54,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69fa22dc6/de54dc91be274cd28319dddd804050cd/FLAG3f893f112 [2019-10-02 02:01:54,920 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 02:01:54,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/running_example.i [2019-10-02 02:01:54,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69fa22dc6/de54dc91be274cd28319dddd804050cd/FLAG3f893f112 [2019-10-02 02:01:55,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69fa22dc6/de54dc91be274cd28319dddd804050cd [2019-10-02 02:01:55,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 02:01:55,236 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 02:01:55,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 02:01:55,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 02:01:55,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 02:01:55,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:01:55" (1/1) ... [2019-10-02 02:01:55,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@728f4fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:01:55, skipping insertion in model container [2019-10-02 02:01:55,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:01:55" (1/1) ... [2019-10-02 02:01:55,251 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 02:01:55,297 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 02:01:55,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 02:01:55,717 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 02:01:55,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 02:01:55,810 INFO L192 MainTranslator]: Completed translation [2019-10-02 02:01:55,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:01:55 WrapperNode [2019-10-02 02:01:55,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 02:01:55,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 02:01:55,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 02:01:55,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 02:01:55,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:01:55" (1/1) ... [2019-10-02 02:01:55,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:01:55" (1/1) ... [2019-10-02 02:01:55,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:01:55" (1/1) ... [2019-10-02 02:01:55,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:01:55" (1/1) ... [2019-10-02 02:01:55,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:01:55" (1/1) ... [2019-10-02 02:01:55,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:01:55" (1/1) ... [2019-10-02 02:01:55,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:01:55" (1/1) ... [2019-10-02 02:01:55,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 02:01:55,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 02:01:55,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 02:01:55,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 02:01:55,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:01:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 02:01:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 02:01:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 02:01:55,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 02:01:55,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 02:01:55,952 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 02:01:55,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 02:01:55,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 02:01:55,953 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 02:01:55,953 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 02:01:55,953 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 02:01:55,953 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 02:01:55,953 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 02:01:55,953 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 02:01:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 02:01:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 02:01:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 02:01:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 02:01:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 02:01:55,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 02:01:55,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 02:01:55,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 02:01:55,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 02:01:55,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 02:01:55,955 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 02:01:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 02:01:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 02:01:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 02:01:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 02:01:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 02:01:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 02:01:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 02:01:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 02:01:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 02:01:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 02:01:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 02:01:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 02:01:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 02:01:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 02:01:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 02:01:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 02:01:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 02:01:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 02:01:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 02:01:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 02:01:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 02:01:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 02:01:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 02:01:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 02:01:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 02:01:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 02:01:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 02:01:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 02:01:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 02:01:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 02:01:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 02:01:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 02:01:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 02:01:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 02:01:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 02:01:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 02:01:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 02:01:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 02:01:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 02:01:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 02:01:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 02:01:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 02:01:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 02:01:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 02:01:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 02:01:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 02:01:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 02:01:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 02:01:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 02:01:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 02:01:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 02:01:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 02:01:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 02:01:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 02:01:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 02:01:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 02:01:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 02:01:55,965 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 02:01:55,965 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 02:01:55,965 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 02:01:55,965 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 02:01:55,965 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 02:01:55,965 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 02:01:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 02:01:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 02:01:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 02:01:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 02:01:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 02:01:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 02:01:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 02:01:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 02:01:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 02:01:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 02:01:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 02:01:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 02:01:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 02:01:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 02:01:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 02:01:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 02:01:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 02:01:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 02:01:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 02:01:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 02:01:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 02:01:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 02:01:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 02:01:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 02:01:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 02:01:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 02:01:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 02:01:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 02:01:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 02:01:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 02:01:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 02:01:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 02:01:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 02:01:55,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 02:01:56,541 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 02:01:56,542 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 02:01:56,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:01:56 BoogieIcfgContainer [2019-10-02 02:01:56,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 02:01:56,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 02:01:56,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 02:01:56,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 02:01:56,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:01:55" (1/3) ... [2019-10-02 02:01:56,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739dec06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:01:56, skipping insertion in model container [2019-10-02 02:01:56,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:01:55" (2/3) ... [2019-10-02 02:01:56,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739dec06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:01:56, skipping insertion in model container [2019-10-02 02:01:56,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:01:56" (3/3) ... [2019-10-02 02:01:56,552 INFO L109 eAbstractionObserver]: Analyzing ICFG running_example.i [2019-10-02 02:01:56,562 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 02:01:56,570 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 02:01:56,590 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 02:01:56,624 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 02:01:56,625 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 02:01:56,626 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 02:01:56,629 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 02:01:56,630 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 02:01:56,630 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 02:01:56,630 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 02:01:56,638 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 02:01:56,638 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 02:01:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-02 02:01:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-02 02:01:56,667 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:01:56,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:01:56,672 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:01:56,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:01:56,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1790475303, now seen corresponding path program 1 times [2019-10-02 02:01:56,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:01:56,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:01:56,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:56,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:01:56,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 02:01:56,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 02:01:56,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 02:01:56,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 02:01:56,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 02:01:56,866 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-10-02 02:01:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:01:56,892 INFO L93 Difference]: Finished difference Result 32 states and 48 transitions. [2019-10-02 02:01:56,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 02:01:56,894 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-02 02:01:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:01:56,906 INFO L225 Difference]: With dead ends: 32 [2019-10-02 02:01:56,906 INFO L226 Difference]: Without dead ends: 19 [2019-10-02 02:01:56,910 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 02:01:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-02 02:01:56,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-02 02:01:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-02 02:01:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-10-02 02:01:56,954 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2019-10-02 02:01:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:01:56,955 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-02 02:01:56,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 02:01:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-10-02 02:01:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 02:01:56,956 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:01:56,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:01:56,957 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:01:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:01:56,957 INFO L82 PathProgramCache]: Analyzing trace with hash -734348207, now seen corresponding path program 1 times [2019-10-02 02:01:56,957 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:01:56,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:01:56,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:56,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:56,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:01:57,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 02:01:57,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 02:01:57,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 02:01:57,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 02:01:57,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 02:01:57,120 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 6 states. [2019-10-02 02:01:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:01:57,305 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2019-10-02 02:01:57,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 02:01:57,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-10-02 02:01:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:01:57,310 INFO L225 Difference]: With dead ends: 41 [2019-10-02 02:01:57,310 INFO L226 Difference]: Without dead ends: 32 [2019-10-02 02:01:57,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-02 02:01:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-02 02:01:57,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-10-02 02:01:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 02:01:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-02 02:01:57,321 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2019-10-02 02:01:57,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:01:57,322 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-02 02:01:57,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 02:01:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-10-02 02:01:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 02:01:57,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:01:57,323 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:01:57,323 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:01:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:01:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash 147079127, now seen corresponding path program 1 times [2019-10-02 02:01:57,324 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:01:57,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:01:57,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:57,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:57,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:01:57,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:01:57,586 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:01:57,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:57,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 02:01:57,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:01:57,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:01:57,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:57,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:57,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 02:01:57,818 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:57,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:57,830 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-02 02:01:57,830 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2019-10-02 02:01:57,886 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:57,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 02:01:57,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:57,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:57,927 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:01:57,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:57,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:01:57,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-02 02:01:57,964 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:57,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:57,999 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-10-02 02:01:58,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2019-10-02 02:01:58,001 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:58,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:58,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:01:58,019 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:11 [2019-10-02 02:01:58,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:01:58,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:01:58,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-10-02 02:01:58,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 02:01:58,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 02:01:58,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 02:01:58,079 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 10 states. [2019-10-02 02:01:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:01:58,380 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2019-10-02 02:01:58,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 02:01:58,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-10-02 02:01:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:01:58,384 INFO L225 Difference]: With dead ends: 52 [2019-10-02 02:01:58,386 INFO L226 Difference]: Without dead ends: 43 [2019-10-02 02:01:58,389 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-10-02 02:01:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-02 02:01:58,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-10-02 02:01:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-02 02:01:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-10-02 02:01:58,400 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 18 [2019-10-02 02:01:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:01:58,402 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-10-02 02:01:58,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 02:01:58,402 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-10-02 02:01:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 02:01:58,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:01:58,403 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:01:58,404 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:01:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:01:58,404 INFO L82 PathProgramCache]: Analyzing trace with hash 470360634, now seen corresponding path program 1 times [2019-10-02 02:01:58,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:01:58,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:01:58,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:58,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:58,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:01:58,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:01:58,619 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:01:58,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:58,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 02:01:58,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:01:58,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:01:58,789 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 20 treesize of output 9 [2019-10-02 02:01:58,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:58,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:58,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:01:58,803 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 20 treesize of output 9 [2019-10-02 02:01:58,804 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:58,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:58,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:01:58,810 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:22 [2019-10-02 02:01:58,847 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 11 [2019-10-02 02:01:58,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:58,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:58,861 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 11 [2019-10-02 02:01:58,862 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:58,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:58,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:01:58,872 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:18 [2019-10-02 02:01:58,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 02:01:58,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:58,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:58,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 02:01:58,893 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:58,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:58,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:01:58,897 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-02 02:01:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 02:01:58,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:01:58,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 02:01:58,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 02:01:58,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 02:01:58,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 02:01:58,908 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 6 states. [2019-10-02 02:01:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:01:59,059 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-10-02 02:01:59,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 02:01:59,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-02 02:01:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:01:59,062 INFO L225 Difference]: With dead ends: 58 [2019-10-02 02:01:59,062 INFO L226 Difference]: Without dead ends: 49 [2019-10-02 02:01:59,062 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 02:01:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-02 02:01:59,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-10-02 02:01:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 02:01:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-10-02 02:01:59,072 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 20 [2019-10-02 02:01:59,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:01:59,072 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-10-02 02:01:59,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 02:01:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-10-02 02:01:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 02:01:59,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:01:59,073 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:01:59,074 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:01:59,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:01:59,074 INFO L82 PathProgramCache]: Analyzing trace with hash 977312820, now seen corresponding path program 1 times [2019-10-02 02:01:59,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:01:59,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:01:59,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:59,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:59,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:01:59,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:01:59,174 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:01:59,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:59,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 02:01:59,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:01:59,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:59,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-02 02:01:59,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:59,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:59,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:01:59,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-02 02:01:59,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:01:59,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:01:59,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-10-02 02:01:59,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 02:01:59,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 02:01:59,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 02:01:59,344 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 10 states. [2019-10-02 02:01:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:01:59,555 INFO L93 Difference]: Finished difference Result 88 states and 119 transitions. [2019-10-02 02:01:59,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 02:01:59,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-10-02 02:01:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:01:59,558 INFO L225 Difference]: With dead ends: 88 [2019-10-02 02:01:59,558 INFO L226 Difference]: Without dead ends: 86 [2019-10-02 02:01:59,559 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-10-02 02:01:59,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-02 02:01:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2019-10-02 02:01:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-02 02:01:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 82 transitions. [2019-10-02 02:01:59,577 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 82 transitions. Word has length 22 [2019-10-02 02:01:59,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:01:59,578 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 82 transitions. [2019-10-02 02:01:59,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 02:01:59,578 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 82 transitions. [2019-10-02 02:01:59,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 02:01:59,579 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:01:59,579 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:01:59,579 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:01:59,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:01:59,580 INFO L82 PathProgramCache]: Analyzing trace with hash 977314742, now seen corresponding path program 1 times [2019-10-02 02:01:59,580 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:01:59,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:01:59,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:59,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:59,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:01:59,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:01:59,751 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:01:59,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:59,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 02:01:59,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:01:59,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 02:01:59,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:59,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:59,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:01:59,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-02 02:01:59,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-02 02:01:59,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:59,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:59,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:01:59,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-02 02:01:59,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:01:59,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:01:59,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2019-10-02 02:01:59,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 02:01:59,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 02:01:59,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-10-02 02:01:59,984 INFO L87 Difference]: Start difference. First operand 58 states and 82 transitions. Second operand 11 states. [2019-10-02 02:02:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:02:00,263 INFO L93 Difference]: Finished difference Result 98 states and 134 transitions. [2019-10-02 02:02:00,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 02:02:00,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-10-02 02:02:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:02:00,267 INFO L225 Difference]: With dead ends: 98 [2019-10-02 02:02:00,267 INFO L226 Difference]: Without dead ends: 82 [2019-10-02 02:02:00,268 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-02 02:02:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-02 02:02:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2019-10-02 02:02:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-02 02:02:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2019-10-02 02:02:00,279 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 22 [2019-10-02 02:02:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:02:00,279 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2019-10-02 02:02:00,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 02:02:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2019-10-02 02:02:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 02:02:00,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:02:00,280 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:02:00,280 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:02:00,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:02:00,281 INFO L82 PathProgramCache]: Analyzing trace with hash 167966194, now seen corresponding path program 1 times [2019-10-02 02:02:00,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:02:00,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:02:00,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:02:00,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:02:00,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:02:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:02:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 02:02:00,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 02:02:00,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 02:02:00,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 02:02:00,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 02:02:00,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 02:02:00,335 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. Second operand 6 states. [2019-10-02 02:02:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:02:00,421 INFO L93 Difference]: Finished difference Result 100 states and 137 transitions. [2019-10-02 02:02:00,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 02:02:00,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-02 02:02:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:02:00,423 INFO L225 Difference]: With dead ends: 100 [2019-10-02 02:02:00,423 INFO L226 Difference]: Without dead ends: 76 [2019-10-02 02:02:00,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-02 02:02:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-02 02:02:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-10-02 02:02:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-02 02:02:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2019-10-02 02:02:00,434 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 22 [2019-10-02 02:02:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:02:00,434 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2019-10-02 02:02:00,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 02:02:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2019-10-02 02:02:00,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 02:02:00,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:02:00,435 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:02:00,436 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:02:00,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:02:00,436 INFO L82 PathProgramCache]: Analyzing trace with hash 238325853, now seen corresponding path program 2 times [2019-10-02 02:02:00,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:02:00,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:02:00,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:02:00,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:02:00,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:02:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:02:00,566 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-02 02:02:00,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:02:00,567 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:02:00,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 02:02:00,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 02:02:00,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:02:00,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-02 02:02:00,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:02:00,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:02:00,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:00,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:00,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 02:02:00,702 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:00,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:00,714 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-02 02:02:00,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2019-10-02 02:02:00,760 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:00,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 02:02:00,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:00,831 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.6 percent of original size [2019-10-02 02:02:00,837 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:02:00,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:00,869 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:02:00,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:00,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:02:00,906 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-10-02 02:02:00,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36 [2019-10-02 02:02:00,908 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:00,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:00,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:02:00,933 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:79, output treesize:25 [2019-10-02 02:02:00,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:00,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-02 02:02:00,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:01,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:01,017 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 11 [2019-10-02 02:02:01,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:01,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:01,040 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 11 [2019-10-02 02:02:01,041 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:01,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:01,060 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 19 treesize of output 18 [2019-10-02 02:02:01,061 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:01,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:01,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:02:01,085 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:79, output treesize:11 [2019-10-02 02:02:01,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:02:01,118 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-02 02:02:01,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:02:01,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-10-02 02:02:01,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 02:02:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 02:02:01,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 02:02:01,123 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand 11 states. [2019-10-02 02:02:01,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:02:01,444 INFO L93 Difference]: Finished difference Result 137 states and 190 transitions. [2019-10-02 02:02:01,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 02:02:01,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-10-02 02:02:01,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:02:01,446 INFO L225 Difference]: With dead ends: 137 [2019-10-02 02:02:01,446 INFO L226 Difference]: Without dead ends: 117 [2019-10-02 02:02:01,447 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-10-02 02:02:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-02 02:02:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 71. [2019-10-02 02:02:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-02 02:02:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2019-10-02 02:02:01,462 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 22 [2019-10-02 02:02:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:02:01,463 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2019-10-02 02:02:01,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 02:02:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2019-10-02 02:02:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 02:02:01,464 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:02:01,464 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:02:01,464 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:02:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:02:01,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2035848896, now seen corresponding path program 1 times [2019-10-02 02:02:01,464 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:02:01,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:02:01,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:02:01,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:02:01,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:02:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:02:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:02:01,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:02:01,783 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:02:01,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:02:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:02:01,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 02:02:01,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:02:01,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:02:01,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:01,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:01,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:02:01,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:02:01,951 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:01,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 02:02:01,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:01,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:01,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:02:01,996 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 36 treesize of output 17 [2019-10-02 02:02:01,996 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:02,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:02,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:02:02,025 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 36 treesize of output 17 [2019-10-02 02:02:02,026 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:02,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:02,056 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-02 02:02:02,057 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:02,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:02,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:02:02,072 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:101, output treesize:61 [2019-10-02 02:02:02,157 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 0 case distinctions, treesize of input 65 treesize of output 51 [2019-10-02 02:02:02,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:02,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:02,223 INFO L341 Elim1Store]: treesize reduction 32, result has 59.0 percent of original size [2019-10-02 02:02:02,224 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 2 case distinctions, treesize of input 73 treesize of output 87 [2019-10-02 02:02:02,225 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:02,273 INFO L567 ElimStorePlain]: treesize reduction 44, result has 63.9 percent of original size [2019-10-02 02:02:02,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-10-02 02:02:02,280 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:02,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:02,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:02:02,291 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:108, output treesize:61 [2019-10-02 02:02:02,306 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:02,306 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 65 treesize of output 56 [2019-10-02 02:02:02,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:02,330 INFO L567 ElimStorePlain]: treesize reduction 18, result has 66.7 percent of original size [2019-10-02 02:02:02,334 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2019-10-02 02:02:02,335 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:02,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:02,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:02:02,343 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:7 [2019-10-02 02:02:02,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:02:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:02:02,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:02:02,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2019-10-02 02:02:02,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 02:02:02,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 02:02:02,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 02:02:02,356 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand 11 states. [2019-10-02 02:02:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:02:03,900 INFO L93 Difference]: Finished difference Result 166 states and 224 transitions. [2019-10-02 02:02:03,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 02:02:03,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-10-02 02:02:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:02:03,903 INFO L225 Difference]: With dead ends: 166 [2019-10-02 02:02:03,903 INFO L226 Difference]: Without dead ends: 164 [2019-10-02 02:02:03,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2019-10-02 02:02:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-02 02:02:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 115. [2019-10-02 02:02:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-02 02:02:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2019-10-02 02:02:03,917 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 24 [2019-10-02 02:02:03,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:02:03,917 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2019-10-02 02:02:03,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 02:02:03,918 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2019-10-02 02:02:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 02:02:03,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:02:03,919 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:02:03,919 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:02:03,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:02:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2035846974, now seen corresponding path program 1 times [2019-10-02 02:02:03,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:02:03,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:02:03,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:02:03,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:02:03,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:02:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:02:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:02:04,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:02:04,152 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:02:04,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:02:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:02:04,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 02:02:04,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:02:04,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:02:04,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:04,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:02:04,312 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:04,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 02:02:04,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:04,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:02:04,349 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 40 treesize of output 19 [2019-10-02 02:02:04,350 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:04,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:02:04,383 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 40 treesize of output 19 [2019-10-02 02:02:04,383 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:04,408 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-02 02:02:04,409 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:04,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,427 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:109, output treesize:75 [2019-10-02 02:02:04,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-10-02 02:02:04,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:04,556 INFO L341 Elim1Store]: treesize reduction 32, result has 59.0 percent of original size [2019-10-02 02:02:04,557 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 2 case distinctions, treesize of input 73 treesize of output 87 [2019-10-02 02:02:04,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,599 INFO L567 ElimStorePlain]: treesize reduction 44, result has 63.3 percent of original size [2019-10-02 02:02:04,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2019-10-02 02:02:04,603 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:04,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,615 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:108, output treesize:61 [2019-10-02 02:02:04,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:04,643 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 65 treesize of output 56 [2019-10-02 02:02:04,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,660 INFO L567 ElimStorePlain]: treesize reduction 18, result has 66.7 percent of original size [2019-10-02 02:02:04,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2019-10-02 02:02:04,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:04,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:02:04,669 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:7 [2019-10-02 02:02:04,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:02:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:02:04,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:02:04,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-10-02 02:02:04,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 02:02:04,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 02:02:04,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 02:02:04,695 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand 11 states. [2019-10-02 02:02:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:02:06,257 INFO L93 Difference]: Finished difference Result 265 states and 379 transitions. [2019-10-02 02:02:06,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 02:02:06,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-10-02 02:02:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:02:06,260 INFO L225 Difference]: With dead ends: 265 [2019-10-02 02:02:06,260 INFO L226 Difference]: Without dead ends: 208 [2019-10-02 02:02:06,262 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2019-10-02 02:02:06,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-02 02:02:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 168. [2019-10-02 02:02:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-02 02:02:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 240 transitions. [2019-10-02 02:02:06,288 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 240 transitions. Word has length 24 [2019-10-02 02:02:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:02:06,289 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 240 transitions. [2019-10-02 02:02:06,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 02:02:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 240 transitions. [2019-10-02 02:02:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 02:02:06,291 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:02:06,291 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:02:06,291 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:02:06,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:02:06,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1986609468, now seen corresponding path program 1 times [2019-10-02 02:02:06,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:02:06,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:02:06,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:02:06,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:02:06,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:02:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:02:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 02:02:06,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:02:06,405 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:02:06,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:02:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:02:06,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 02:02:06,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:02:06,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-02 02:02:06,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:02:06,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:02:06,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:02:06,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-02 02:02:06,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:02:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 02:02:06,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:02:06,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2019-10-02 02:02:06,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 02:02:06,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 02:02:06,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 02:02:06,535 INFO L87 Difference]: Start difference. First operand 168 states and 240 transitions. Second operand 8 states. [2019-10-02 02:02:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:02:06,669 INFO L93 Difference]: Finished difference Result 308 states and 441 transitions. [2019-10-02 02:02:06,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 02:02:06,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-10-02 02:02:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:02:06,672 INFO L225 Difference]: With dead ends: 308 [2019-10-02 02:02:06,672 INFO L226 Difference]: Without dead ends: 237 [2019-10-02 02:02:06,673 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-02 02:02:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-02 02:02:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 201. [2019-10-02 02:02:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-02 02:02:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 292 transitions. [2019-10-02 02:02:06,689 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 292 transitions. Word has length 26 [2019-10-02 02:02:06,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:02:06,691 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 292 transitions. [2019-10-02 02:02:06,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 02:02:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 292 transitions. [2019-10-02 02:02:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 02:02:06,699 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:02:06,700 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:02:06,700 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:02:06,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:02:06,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1177260920, now seen corresponding path program 1 times [2019-10-02 02:02:06,700 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:02:06,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:02:06,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:02:06,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:02:06,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:02:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:02:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 02:02:06,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:02:06,838 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:02:06,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:02:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:02:06,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 02:02:06,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:02:06,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:02:06,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:02:06,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2019-10-02 02:02:06,986 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:02:06,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2019-10-02 02:02:06,997 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:02:07,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-10-02 02:02:07,009 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:02:07,046 INFO L567 ElimStorePlain]: treesize reduction 28, result has 53.3 percent of original size [2019-10-02 02:02:07,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-02 02:02:07,048 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:112, output treesize:32 [2019-10-02 02:02:11,817 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 23 DAG size of output: 13 [2019-10-02 02:02:14,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:02:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 02:02:14,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:02:14,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-10-02 02:02:14,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 02:02:14,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 02:02:14,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=63, Unknown=4, NotChecked=0, Total=90 [2019-10-02 02:02:14,492 INFO L87 Difference]: Start difference. First operand 201 states and 292 transitions. Second operand 10 states. [2019-10-02 02:03:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:03:37,993 INFO L93 Difference]: Finished difference Result 315 states and 451 transitions. [2019-10-02 02:03:37,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 02:03:37,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-10-02 02:03:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:03:37,999 INFO L225 Difference]: With dead ends: 315 [2019-10-02 02:03:37,999 INFO L226 Difference]: Without dead ends: 288 [2019-10-02 02:03:38,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=67, Invalid=131, Unknown=12, NotChecked=0, Total=210 [2019-10-02 02:03:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-10-02 02:03:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 174. [2019-10-02 02:03:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-10-02 02:03:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 256 transitions. [2019-10-02 02:03:38,021 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 256 transitions. Word has length 26 [2019-10-02 02:03:38,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:03:38,023 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 256 transitions. [2019-10-02 02:03:38,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 02:03:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 256 transitions. [2019-10-02 02:03:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 02:03:38,031 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:03:38,031 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:03:38,031 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:03:38,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:03:38,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1177262842, now seen corresponding path program 1 times [2019-10-02 02:03:38,032 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:03:38,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:03:38,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:38,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:03:38,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:03:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 02:03:38,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:03:38,119 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:03:38,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:03:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:03:38,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 02:03:38,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:03:38,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:38,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:38,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:38,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2019-10-02 02:03:38,272 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:03:38,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2019-10-02 02:03:38,282 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:03:38,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2019-10-02 02:03:38,299 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:03:38,341 INFO L567 ElimStorePlain]: treesize reduction 36, result has 47.8 percent of original size [2019-10-02 02:03:38,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-02 02:03:38,342 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:133, output treesize:33 [2019-10-02 02:03:38,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 02:03:38,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:03:38,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-10-02 02:03:38,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 02:03:38,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 02:03:38,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-10-02 02:03:38,390 INFO L87 Difference]: Start difference. First operand 174 states and 256 transitions. Second operand 12 states. [2019-10-02 02:03:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:03:38,851 INFO L93 Difference]: Finished difference Result 357 states and 519 transitions. [2019-10-02 02:03:38,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 02:03:38,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-10-02 02:03:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:03:38,854 INFO L225 Difference]: With dead ends: 357 [2019-10-02 02:03:38,854 INFO L226 Difference]: Without dead ends: 275 [2019-10-02 02:03:38,855 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-10-02 02:03:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-02 02:03:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 196. [2019-10-02 02:03:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-02 02:03:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 284 transitions. [2019-10-02 02:03:38,869 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 284 transitions. Word has length 26 [2019-10-02 02:03:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:03:38,869 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 284 transitions. [2019-10-02 02:03:38,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 02:03:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 284 transitions. [2019-10-02 02:03:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 02:03:38,870 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:03:38,870 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:03:38,870 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:03:38,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:03:38,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1528741190, now seen corresponding path program 2 times [2019-10-02 02:03:38,871 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:03:38,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:03:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:38,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:03:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:03:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:03:39,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:03:39,204 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:03:39,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 02:03:39,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 02:03:39,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:03:39,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-02 02:03:39,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:03:39,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:03:39,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:39,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:39,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:03:39,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:03:39,393 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:39,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 02:03:39,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:39,551 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-02 02:03:39,552 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.2 percent of original size [2019-10-02 02:03:39,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:03:39,566 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 40 treesize of output 19 [2019-10-02 02:03:39,567 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:39,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:39,614 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-02 02:03:39,615 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:39,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:39,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:03:39,660 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 40 treesize of output 19 [2019-10-02 02:03:39,660 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:39,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:39,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:03:39,688 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:118, output treesize:79 [2019-10-02 02:03:39,778 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:39,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-10-02 02:03:39,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:39,890 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-10-02 02:03:39,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:39,892 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_44|, |v_#memory_int_42|, |v_#memory_int_43|], 14=[|v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_22|]} [2019-10-02 02:03:39,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:03:39,909 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 57 treesize of output 23 [2019-10-02 02:03:39,910 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:40,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:40,022 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 23 [2019-10-02 02:03:40,022 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:40,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:40,090 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 31 treesize of output 30 [2019-10-02 02:03:40,091 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:40,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:40,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:03:40,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:40,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 112 [2019-10-02 02:03:40,184 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:40,295 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-10-02 02:03:40,295 INFO L567 ElimStorePlain]: treesize reduction 36, result has 85.2 percent of original size [2019-10-02 02:03:40,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:03:40,519 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-10-02 02:03:40,520 INFO L341 Elim1Store]: treesize reduction 146, result has 59.3 percent of original size [2019-10-02 02:03:40,520 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 4 case distinctions, treesize of input 175 treesize of output 287 [2019-10-02 02:03:40,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:40,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:40,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:40,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:40,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:40,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:40,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:40,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:40,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:40,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:40,595 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:41,344 WARN L191 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 56 [2019-10-02 02:03:41,345 INFO L567 ElimStorePlain]: treesize reduction 15752, result has 1.5 percent of original size [2019-10-02 02:03:41,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:03:41,348 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:300, output treesize:360 [2019-10-02 02:03:41,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,639 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_45|], 30=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_23|]} [2019-10-02 02:03:41,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:03:41,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 183 [2019-10-02 02:03:41,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:41,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 200 [2019-10-02 02:03:41,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:41,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:41,892 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-10-02 02:03:41,893 INFO L341 Elim1Store]: treesize reduction 52, result has 63.6 percent of original size [2019-10-02 02:03:41,893 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 171 treesize of output 182 [2019-10-02 02:03:41,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:41,907 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:03:42,148 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-10-02 02:03:42,148 INFO L341 Elim1Store]: treesize reduction 76, result has 67.0 percent of original size [2019-10-02 02:03:42,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 188 treesize of output 260 [2019-10-02 02:03:42,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,167 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:03:42,356 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 65 [2019-10-02 02:03:42,357 INFO L567 ElimStorePlain]: treesize reduction 312, result has 45.8 percent of original size [2019-10-02 02:03:42,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 95 [2019-10-02 02:03:42,380 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:42,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:42,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 137 [2019-10-02 02:03:42,397 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:42,543 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-02 02:03:42,543 INFO L567 ElimStorePlain]: treesize reduction 40, result has 85.4 percent of original size [2019-10-02 02:03:42,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-02 02:03:42,545 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:394, output treesize:300 [2019-10-02 02:03:42,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,553 INFO L392 ElimStorePlain]: Different costs {6=[v_prenex_2, v_prenex_3], 12=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} [2019-10-02 02:03:42,586 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:42,587 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 125 [2019-10-02 02:03:42,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,595 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:03:42,714 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-10-02 02:03:42,714 INFO L567 ElimStorePlain]: treesize reduction 72, result has 75.3 percent of original size [2019-10-02 02:03:42,721 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2019-10-02 02:03:42,722 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:42,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:42,859 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:42,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 184 [2019-10-02 02:03:42,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:42,867 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:03:42,972 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-10-02 02:03:42,973 INFO L567 ElimStorePlain]: treesize reduction 74, result has 58.2 percent of original size [2019-10-02 02:03:42,981 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:42,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 64 [2019-10-02 02:03:42,983 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:43,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:43,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:43,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:03:43,013 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:322, output treesize:7 [2019-10-02 02:03:43,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:03:43,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:03:43,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-10-02 02:03:43,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 02:03:43,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 02:03:43,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 02:03:43,029 INFO L87 Difference]: Start difference. First operand 196 states and 284 transitions. Second operand 13 states. [2019-10-02 02:03:44,558 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-10-02 02:03:44,789 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-10-02 02:03:45,117 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 112 [2019-10-02 02:03:45,525 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 117 [2019-10-02 02:03:46,137 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-10-02 02:03:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:03:46,881 INFO L93 Difference]: Finished difference Result 288 states and 405 transitions. [2019-10-02 02:03:46,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 02:03:46,881 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-10-02 02:03:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:03:46,882 INFO L225 Difference]: With dead ends: 288 [2019-10-02 02:03:46,882 INFO L226 Difference]: Without dead ends: 286 [2019-10-02 02:03:46,883 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 02:03:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-02 02:03:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 229. [2019-10-02 02:03:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-02 02:03:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 333 transitions. [2019-10-02 02:03:46,899 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 333 transitions. Word has length 28 [2019-10-02 02:03:46,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:03:46,899 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 333 transitions. [2019-10-02 02:03:46,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 02:03:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 333 transitions. [2019-10-02 02:03:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 02:03:46,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:03:46,901 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:03:46,901 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:03:46,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:03:46,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1528743112, now seen corresponding path program 2 times [2019-10-02 02:03:46,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:03:46,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:03:46,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:46,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:03:46,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:03:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:03:47,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:03:47,166 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:03:47,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 02:03:47,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 02:03:47,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:03:47,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-02 02:03:47,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:03:47,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:03:47,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:47,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:47,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:03:47,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:03:47,328 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:47,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 02:03:47,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:47,440 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-02 02:03:47,441 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.5 percent of original size [2019-10-02 02:03:47,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:03:47,454 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 36 treesize of output 17 [2019-10-02 02:03:47,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:47,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:47,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:03:47,500 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 36 treesize of output 17 [2019-10-02 02:03:47,501 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:47,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:47,534 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-02 02:03:47,534 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:47,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:47,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:03:47,560 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:110, output treesize:69 [2019-10-02 02:03:47,671 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:47,671 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 20 treesize of output 30 [2019-10-02 02:03:47,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:47,850 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-02 02:03:47,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:47,854 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_48|, |v_#memory_int_49|, |v_#memory_int_47|], 14=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_25|]} [2019-10-02 02:03:47,861 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:03:48,028 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-02 02:03:48,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:48,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:03:48,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 19 [2019-10-02 02:03:48,057 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:48,168 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-10-02 02:03:48,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:48,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:03:48,189 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 32 treesize of output 35 [2019-10-02 02:03:48,190 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:48,295 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-10-02 02:03:48,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:48,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:03:48,523 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-02 02:03:48,523 INFO L341 Elim1Store]: treesize reduction 132, result has 58.9 percent of original size [2019-10-02 02:03:48,523 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 4 case distinctions, treesize of input 178 treesize of output 276 [2019-10-02 02:03:48,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:48,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:48,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:48,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:48,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:48,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:48,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:48,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:48,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:48,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:48,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:48,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:48,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:48,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:48,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:48,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:48,546 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:48,993 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 63 [2019-10-02 02:03:48,993 INFO L567 ElimStorePlain]: treesize reduction 3677, result has 7.7 percent of original size [2019-10-02 02:03:48,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:03:49,233 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-02 02:03:49,234 INFO L341 Elim1Store]: treesize reduction 66, result has 79.7 percent of original size [2019-10-02 02:03:49,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, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 274 treesize of output 402 [2019-10-02 02:03:49,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:49,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:49,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:49,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:49,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:49,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:50,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:50,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:03:50,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:03:50,325 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 69 xjuncts. [2019-10-02 02:04:05,739 WARN L191 SmtUtils]: Spent 15.41 s on a formula simplification. DAG size of input: 1251 DAG size of output: 59 [2019-10-02 02:04:05,740 INFO L567 ElimStorePlain]: treesize reduction 357336, result has 0.1 percent of original size [2019-10-02 02:04:05,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:05,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:05,743 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:260, output treesize:298 [2019-10-02 02:04:06,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,030 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_50|], 30=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_26|]} [2019-10-02 02:04:06,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:04:06,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 183 [2019-10-02 02:04:06,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:06,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 200 [2019-10-02 02:04:06,051 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:06,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:06,259 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-10-02 02:04:06,260 INFO L341 Elim1Store]: treesize reduction 52, result has 63.6 percent of original size [2019-10-02 02:04:06,260 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 171 treesize of output 182 [2019-10-02 02:04:06,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,278 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:06,462 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-10-02 02:04:06,463 INFO L341 Elim1Store]: treesize reduction 76, result has 67.0 percent of original size [2019-10-02 02:04:06,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 188 treesize of output 260 [2019-10-02 02:04:06,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,475 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:06,655 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 65 [2019-10-02 02:04:06,655 INFO L567 ElimStorePlain]: treesize reduction 312, result has 45.8 percent of original size [2019-10-02 02:04:06,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:06,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 137 [2019-10-02 02:04:06,688 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:06,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 95 [2019-10-02 02:04:06,702 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:06,813 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-02 02:04:06,813 INFO L567 ElimStorePlain]: treesize reduction 26, result has 90.0 percent of original size [2019-10-02 02:04:06,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-02 02:04:06,815 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:394, output treesize:300 [2019-10-02 02:04:06,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,826 INFO L392 ElimStorePlain]: Different costs {6=[v_prenex_5, v_prenex_6], 12=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} [2019-10-02 02:04:06,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:06,860 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 125 [2019-10-02 02:04:06,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,865 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:06,964 INFO L567 ElimStorePlain]: treesize reduction 72, result has 75.3 percent of original size [2019-10-02 02:04:06,969 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2019-10-02 02:04:06,970 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:07,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:07,088 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:07,089 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 169 treesize of output 184 [2019-10-02 02:04:07,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:07,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:07,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:07,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:07,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:07,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:07,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:07,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:07,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:07,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:07,101 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:07,204 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-10-02 02:04:07,205 INFO L567 ElimStorePlain]: treesize reduction 74, result has 58.2 percent of original size [2019-10-02 02:04:07,217 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:07,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 64 [2019-10-02 02:04:07,218 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:07,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:07,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:07,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:07,249 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:322, output treesize:7 [2019-10-02 02:04:07,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:04:07,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:04:07,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-10-02 02:04:07,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 02:04:07,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 02:04:07,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-02 02:04:07,286 INFO L87 Difference]: Start difference. First operand 229 states and 333 transitions. Second operand 12 states. [2019-10-02 02:04:08,006 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 121 [2019-10-02 02:04:08,674 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-10-02 02:04:08,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:04:08,922 INFO L93 Difference]: Finished difference Result 357 states and 518 transitions. [2019-10-02 02:04:08,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 02:04:08,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-10-02 02:04:08,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:04:08,925 INFO L225 Difference]: With dead ends: 357 [2019-10-02 02:04:08,925 INFO L226 Difference]: Without dead ends: 262 [2019-10-02 02:04:08,928 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2019-10-02 02:04:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-02 02:04:08,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 241. [2019-10-02 02:04:08,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-02 02:04:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 347 transitions. [2019-10-02 02:04:08,947 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 347 transitions. Word has length 28 [2019-10-02 02:04:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:04:08,950 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 347 transitions. [2019-10-02 02:04:08,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 02:04:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 347 transitions. [2019-10-02 02:04:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 02:04:08,951 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:04:08,951 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:04:08,951 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:04:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:04:08,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1671418151, now seen corresponding path program 1 times [2019-10-02 02:04:08,952 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:04:08,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:04:08,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:04:08,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:04:08,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:04:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:04:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:04:09,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:04:09,287 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:04:09,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:04:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:04:09,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 02:04:09,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:04:09,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:04:09,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:09,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:09,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:09,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:04:09,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:09,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 02:04:09,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:09,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:09,550 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 38 treesize of output 17 [2019-10-02 02:04:09,550 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:09,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:09,575 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 38 treesize of output 17 [2019-10-02 02:04:09,575 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:09,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:09,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:09,589 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:90, output treesize:49 [2019-10-02 02:04:09,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:04:09,620 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:04:09,625 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:09,625 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 52 treesize of output 42 [2019-10-02 02:04:09,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:09,655 INFO L567 ElimStorePlain]: treesize reduction 30, result has 68.1 percent of original size [2019-10-02 02:04:09,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:04:09,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-10-02 02:04:09,659 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:09,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:09,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:09,668 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:49 [2019-10-02 02:04:09,707 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:09,707 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 41 treesize of output 52 [2019-10-02 02:04:09,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:09,741 INFO L567 ElimStorePlain]: treesize reduction 24, result has 73.6 percent of original size [2019-10-02 02:04:09,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:04:09,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:09,749 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 53 treesize of output 43 [2019-10-02 02:04:09,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:09,773 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2019-10-02 02:04:09,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:09,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:52 [2019-10-02 02:04:09,779 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:04:09,792 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-02 02:04:09,793 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-02 02:04:09,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:09,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:09,794 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:09,814 INFO L567 ElimStorePlain]: treesize reduction 8, result has 81.4 percent of original size [2019-10-02 02:04:09,820 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:09,820 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-02 02:04:09,821 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:09,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:09,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:09,826 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:7 [2019-10-02 02:04:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Stream closed [2019-10-02 02:04:09,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:04:09,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-10-02 02:04:09,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 02:04:09,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 02:04:09,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 02:04:09,840 INFO L87 Difference]: Start difference. First operand 241 states and 347 transitions. Second operand 10 states. [2019-10-02 02:04:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:04:10,336 INFO L93 Difference]: Finished difference Result 434 states and 625 transitions. [2019-10-02 02:04:10,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 02:04:10,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-10-02 02:04:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:04:10,339 INFO L225 Difference]: With dead ends: 434 [2019-10-02 02:04:10,339 INFO L226 Difference]: Without dead ends: 294 [2019-10-02 02:04:10,341 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-10-02 02:04:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-02 02:04:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 252. [2019-10-02 02:04:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-02 02:04:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 357 transitions. [2019-10-02 02:04:10,365 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 357 transitions. Word has length 30 [2019-10-02 02:04:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:04:10,365 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 357 transitions. [2019-10-02 02:04:10,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 02:04:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 357 transitions. [2019-10-02 02:04:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 02:04:10,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:04:10,367 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:04:10,367 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:04:10,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:04:10,367 INFO L82 PathProgramCache]: Analyzing trace with hash 18101349, now seen corresponding path program 2 times [2019-10-02 02:04:10,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:04:10,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:04:10,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:04:10,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:04:10,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:04:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:04:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:04:10,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:04:10,596 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:04:10,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 02:04:10,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 02:04:10,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:04:10,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 02:04:10,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:04:10,721 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 15 treesize of output 1 [2019-10-02 02:04:10,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:10,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:10,731 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 15 treesize of output 1 [2019-10-02 02:04:10,731 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:10,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:10,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:10,737 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:10 [2019-10-02 02:04:10,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:04:10,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-02 02:04:10,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:10,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:10,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:04:10,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-02 02:04:10,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:10,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:10,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:10,776 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:22 [2019-10-02 02:04:10,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 02:04:10,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:10,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:10,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 02:04:10,789 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:10,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:10,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:10,793 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-02 02:04:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 02:04:10,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:04:10,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2019-10-02 02:04:10,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 02:04:10,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 02:04:10,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-02 02:04:10,800 INFO L87 Difference]: Start difference. First operand 252 states and 357 transitions. Second operand 9 states. [2019-10-02 02:04:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:04:11,228 INFO L93 Difference]: Finished difference Result 572 states and 810 transitions. [2019-10-02 02:04:11,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 02:04:11,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-10-02 02:04:11,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:04:11,235 INFO L225 Difference]: With dead ends: 572 [2019-10-02 02:04:11,235 INFO L226 Difference]: Without dead ends: 214 [2019-10-02 02:04:11,239 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-10-02 02:04:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-02 02:04:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 207. [2019-10-02 02:04:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-02 02:04:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 272 transitions. [2019-10-02 02:04:11,257 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 272 transitions. Word has length 32 [2019-10-02 02:04:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:04:11,258 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 272 transitions. [2019-10-02 02:04:11,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 02:04:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 272 transitions. [2019-10-02 02:04:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 02:04:11,258 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:04:11,258 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:04:11,259 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:04:11,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:04:11,259 INFO L82 PathProgramCache]: Analyzing trace with hash 656732581, now seen corresponding path program 3 times [2019-10-02 02:04:11,259 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:04:11,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:04:11,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:04:11,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:04:11,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:04:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:04:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:04:11,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:04:11,559 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:04:11,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 02:04:11,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 02:04:11,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:04:11,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-02 02:04:11,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:04:11,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:04:11,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:11,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:11,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 02:04:11,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:11,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:11,787 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-02 02:04:11,787 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2019-10-02 02:04:11,820 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:11,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 02:04:11,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:11,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:11,857 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_32|, |v_#memory_int_53|], 2=[|v_#memory_int_52|, |v_#memory_int_54|]} [2019-10-02 02:04:11,864 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 38 treesize of output 17 [2019-10-02 02:04:11,864 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:11,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:11,892 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:11,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:11,912 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:11,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:11,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:04:11,933 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 42 treesize of output 34 [2019-10-02 02:04:11,934 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:11,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:11,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:11,949 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:104, output treesize:31 [2019-10-02 02:04:12,005 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-02 02:04:12,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:12,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:12,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:04:12,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-10-02 02:04:12,027 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:12,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:12,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:12,041 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:37 [2019-10-02 02:04:12,069 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 10 [2019-10-02 02:04:12,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:12,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:12,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:12,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:14 [2019-10-02 02:04:12,141 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:12,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 49 [2019-10-02 02:04:12,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:12,173 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2019-10-02 02:04:12,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:12,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:36 [2019-10-02 02:04:12,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Stream closed [2019-10-02 02:04:12,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:04:12,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-10-02 02:04:12,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 02:04:12,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 02:04:12,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-10-02 02:04:12,332 INFO L87 Difference]: Start difference. First operand 207 states and 272 transitions. Second operand 21 states. [2019-10-02 02:04:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:04:15,282 INFO L93 Difference]: Finished difference Result 339 states and 439 transitions. [2019-10-02 02:04:15,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 02:04:15,282 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2019-10-02 02:04:15,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:04:15,284 INFO L225 Difference]: With dead ends: 339 [2019-10-02 02:04:15,284 INFO L226 Difference]: Without dead ends: 277 [2019-10-02 02:04:15,285 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2019-10-02 02:04:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-10-02 02:04:15,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 215. [2019-10-02 02:04:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-10-02 02:04:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 281 transitions. [2019-10-02 02:04:15,301 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 281 transitions. Word has length 32 [2019-10-02 02:04:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:04:15,302 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 281 transitions. [2019-10-02 02:04:15,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 02:04:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 281 transitions. [2019-10-02 02:04:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 02:04:15,303 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:04:15,303 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:04:15,303 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:04:15,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:04:15,303 INFO L82 PathProgramCache]: Analyzing trace with hash -152615967, now seen corresponding path program 1 times [2019-10-02 02:04:15,303 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:04:15,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:04:15,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:04:15,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:04:15,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:04:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:04:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:04:15,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:04:15,577 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:04:15,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:04:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:04:15,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-02 02:04:15,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:04:15,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:04:15,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:15,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:15,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:15,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:04:15,751 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:15,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 02:04:15,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:15,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:15,775 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 02:04:15,776 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 1 case distinctions, treesize of input 40 treesize of output 19 [2019-10-02 02:04:15,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:15,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:15,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:15,784 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:29 [2019-10-02 02:04:15,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:15,977 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|], 6=[|v_#memory_$Pointer$.base_33|]} [2019-10-02 02:04:15,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-02 02:04:15,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:15,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:16,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:04:16,034 INFO L341 Elim1Store]: treesize reduction 24, result has 60.0 percent of original size [2019-10-02 02:04:16,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, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 55 [2019-10-02 02:04:16,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:16,066 INFO L567 ElimStorePlain]: treesize reduction 44, result has 48.8 percent of original size [2019-10-02 02:04:16,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:16,067 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:42 [2019-10-02 02:04:16,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:16,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-10-02 02:04:16,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:16,129 INFO L567 ElimStorePlain]: treesize reduction 16, result has 48.4 percent of original size [2019-10-02 02:04:16,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:16,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:15 [2019-10-02 02:04:16,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:16,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:16,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-10-02 02:04:16,168 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:16,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2019-10-02 02:04:16,178 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:16,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2019-10-02 02:04:16,185 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:04:16,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:16,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-10-02 02:04:16,225 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:133, output treesize:93 [2019-10-02 02:04:52,397 WARN L191 SmtUtils]: Spent 32.12 s on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-10-02 02:05:06,483 WARN L191 SmtUtils]: Spent 12.04 s on a formula simplification that was a NOOP. DAG size: 43 [2019-10-02 02:05:06,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:05:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:05:06,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:05:06,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-10-02 02:05:06,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 02:05:06,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 02:05:06,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=390, Unknown=3, NotChecked=0, Total=462 [2019-10-02 02:05:06,502 INFO L87 Difference]: Start difference. First operand 215 states and 281 transitions. Second operand 22 states. [2019-10-02 02:05:55,367 WARN L191 SmtUtils]: Spent 24.10 s on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-10-02 02:06:31,280 WARN L191 SmtUtils]: Spent 31.79 s on a formula simplification that was a NOOP. DAG size: 62 [2019-10-02 02:07:03,516 WARN L191 SmtUtils]: Spent 32.11 s on a formula simplification that was a NOOP. DAG size: 63 [2019-10-02 02:07:19,754 WARN L191 SmtUtils]: Spent 12.05 s on a formula simplification that was a NOOP. DAG size: 49 [2019-10-02 02:07:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:07:19,829 INFO L93 Difference]: Finished difference Result 285 states and 366 transitions. [2019-10-02 02:07:19,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 02:07:19,829 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-02 02:07:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:07:19,831 INFO L225 Difference]: With dead ends: 285 [2019-10-02 02:07:19,831 INFO L226 Difference]: Without dead ends: 226 [2019-10-02 02:07:19,832 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 163.1s TimeCoverageRelationStatistics Valid=181, Invalid=1000, Unknown=9, NotChecked=0, Total=1190 [2019-10-02 02:07:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-02 02:07:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 203. [2019-10-02 02:07:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-02 02:07:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 266 transitions. [2019-10-02 02:07:19,851 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 266 transitions. Word has length 32 [2019-10-02 02:07:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:07:19,851 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 266 transitions. [2019-10-02 02:07:19,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 02:07:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2019-10-02 02:07:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 02:07:19,852 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:07:19,852 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:07:19,853 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:07:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:07:19,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1138713012, now seen corresponding path program 3 times [2019-10-02 02:07:19,853 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:07:19,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:07:19,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:07:19,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:07:19,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:07:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:07:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:07:20,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:07:20,167 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:07:20,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 02:07:20,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 02:07:20,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:07:20,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 77 conjunts are in the unsatisfiable core [2019-10-02 02:07:20,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:07:20,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:07:20,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:20,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:20,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:07:20,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:07:20,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:20,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 02:07:20,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:20,525 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-10-02 02:07:20,525 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.9 percent of original size [2019-10-02 02:07:20,531 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 38 treesize of output 17 [2019-10-02 02:07:20,531 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:20,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:20,571 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-02 02:07:20,572 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:20,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:20,616 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 38 treesize of output 17 [2019-10-02 02:07:20,617 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:20,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:20,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:07:20,649 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:114, output treesize:60 [2019-10-02 02:07:20,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:20,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-10-02 02:07:20,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:21,130 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-10-02 02:07:21,130 INFO L567 ElimStorePlain]: treesize reduction 46, result has 85.7 percent of original size [2019-10-02 02:07:21,132 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_61|, |v_#memory_int_64|], 1=[|v_#memory_int_60|], 10=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_35|]} [2019-10-02 02:07:21,137 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:07:21,260 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-10-02 02:07:21,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:21,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 17 [2019-10-02 02:07:21,272 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:21,384 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-02 02:07:21,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:21,399 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 28 treesize of output 31 [2019-10-02 02:07:21,400 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:21,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:21,490 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:07:21,521 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:21,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, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 187 treesize of output 133 [2019-10-02 02:07:21,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:21,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:21,524 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:21,623 INFO L567 ElimStorePlain]: treesize reduction 74, result has 69.5 percent of original size [2019-10-02 02:07:21,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:21,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 36 [2019-10-02 02:07:21,631 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:21,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:21,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:07:21,675 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:267, output treesize:104 [2019-10-02 02:07:21,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:21,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:21,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-10-02 02:07:21,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:21,925 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-02 02:07:21,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:21,927 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_63|, |v_#memory_int_65|], 1=[|v_#memory_int_62|], 15=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|]} [2019-10-02 02:07:21,937 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:07:22,099 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-10-02 02:07:22,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:22,119 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 59 treesize of output 17 [2019-10-02 02:07:22,119 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:22,227 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-02 02:07:22,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:22,236 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 28 treesize of output 31 [2019-10-02 02:07:22,236 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:22,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:22,333 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:07:22,443 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-02 02:07:22,444 INFO L341 Elim1Store]: treesize reduction 15, result has 87.1 percent of original size [2019-10-02 02:07:22,444 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 267 treesize of output 188 [2019-10-02 02:07:22,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:22,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:22,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:22,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,463 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:07:22,594 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-10-02 02:07:22,594 INFO L567 ElimStorePlain]: treesize reduction 135, result has 50.7 percent of original size [2019-10-02 02:07:22,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:22,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:22,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:22,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 46 [2019-10-02 02:07:22,607 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:22,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:22,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:07:22,647 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:362, output treesize:168 [2019-10-02 02:07:22,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:22,889 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_66|], 14=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_37|]} [2019-10-02 02:07:22,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:22,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2019-10-02 02:07:22,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:22,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:22,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:22,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 129 [2019-10-02 02:07:22,973 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:23,062 INFO L567 ElimStorePlain]: treesize reduction 192, result has 46.7 percent of original size [2019-10-02 02:07:23,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:23,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:23,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:23,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 65 [2019-10-02 02:07:23,071 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:23,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:23,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:07:23,102 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:200, output treesize:153 [2019-10-02 02:07:23,188 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:23,189 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 143 treesize of output 104 [2019-10-02 02:07:23,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,203 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 02:07:23,287 INFO L567 ElimStorePlain]: treesize reduction 36, result has 67.3 percent of original size [2019-10-02 02:07:23,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2019-10-02 02:07:23,292 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:23,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:23,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:07:23,310 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:164, output treesize:22 [2019-10-02 02:07:23,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:07:23,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:07:23,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2019-10-02 02:07:23,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 02:07:23,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 02:07:23,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-10-02 02:07:23,391 INFO L87 Difference]: Start difference. First operand 203 states and 266 transitions. Second operand 19 states. [2019-10-02 02:07:32,206 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-10-02 02:07:36,603 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2019-10-02 02:07:36,867 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-10-02 02:07:41,248 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-10-02 02:07:41,426 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-10-02 02:07:41,611 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-10-02 02:07:41,759 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-10-02 02:07:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:07:42,049 INFO L93 Difference]: Finished difference Result 265 states and 345 transitions. [2019-10-02 02:07:42,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 02:07:42,054 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-10-02 02:07:42,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:07:42,056 INFO L225 Difference]: With dead ends: 265 [2019-10-02 02:07:42,056 INFO L226 Difference]: Without dead ends: 263 [2019-10-02 02:07:42,057 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 02:07:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-02 02:07:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 236. [2019-10-02 02:07:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-02 02:07:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 311 transitions. [2019-10-02 02:07:42,075 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 311 transitions. Word has length 32 [2019-10-02 02:07:42,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:07:42,076 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 311 transitions. [2019-10-02 02:07:42,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 02:07:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 311 transitions. [2019-10-02 02:07:42,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 02:07:42,077 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:07:42,077 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:07:42,077 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:07:42,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:07:42,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1138711090, now seen corresponding path program 3 times [2019-10-02 02:07:42,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:07:42,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:07:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:07:42,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:07:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:07:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:07:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:07:42,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:07:42,387 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:07:42,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 02:07:42,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 02:07:42,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:07:42,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 71 conjunts are in the unsatisfiable core [2019-10-02 02:07:42,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:07:42,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:07:42,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:42,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:42,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:07:42,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:07:42,657 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:42,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 02:07:42,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:42,751 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.9 percent of original size [2019-10-02 02:07:42,760 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 38 treesize of output 17 [2019-10-02 02:07:42,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:42,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:42,798 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 38 treesize of output 17 [2019-10-02 02:07:42,798 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:42,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:42,831 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-02 02:07:42,831 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:42,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:42,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:07:42,859 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:114, output treesize:60 [2019-10-02 02:07:42,937 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:42,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-10-02 02:07:42,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:43,088 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-10-02 02:07:43,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:43,091 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_69|], 2=[|v_#memory_int_72|, |v_#memory_int_68|], 11=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|]} [2019-10-02 02:07:43,100 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:07:43,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:43,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:43,206 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 51 treesize of output 17 [2019-10-02 02:07:43,206 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:43,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:43,291 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 28 treesize of output 31 [2019-10-02 02:07:43,291 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:43,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:43,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:43,361 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:07:43,465 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-10-02 02:07:43,466 INFO L341 Elim1Store]: treesize reduction 37, result has 72.8 percent of original size [2019-10-02 02:07:43,466 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 4 case distinctions, treesize of input 184 treesize of output 172 [2019-10-02 02:07:43,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:43,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:43,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:43,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:43,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:43,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:43,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:43,471 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:43,949 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2019-10-02 02:07:43,950 INFO L567 ElimStorePlain]: treesize reduction 1514, result has 16.6 percent of original size [2019-10-02 02:07:43,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:43,963 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:07:44,052 INFO L341 Elim1Store]: treesize reduction 105, result has 50.9 percent of original size [2019-10-02 02:07:44,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 268 treesize of output 249 [2019-10-02 02:07:44,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:44,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,065 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 7 xjuncts. [2019-10-02 02:07:44,484 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-10-02 02:07:44,485 INFO L567 ElimStorePlain]: treesize reduction 3394, result has 6.0 percent of original size [2019-10-02 02:07:44,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:07:44,487 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:276, output treesize:203 [2019-10-02 02:07:44,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:44,644 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_71|, |v_#memory_int_73|], 3=[|v_#memory_int_70|], 42=[|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_40|]} [2019-10-02 02:07:44,721 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:07:44,757 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:07:46,086 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 118 [2019-10-02 02:07:46,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:46,160 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 389 treesize of output 341 [2019-10-02 02:07:46,160 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:46,219 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 318 treesize of output 276 [2019-10-02 02:07:46,220 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:46,712 WARN L191 SmtUtils]: Spent 492.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-10-02 02:07:46,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:46,791 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:46,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 338 treesize of output 375 [2019-10-02 02:07:46,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:46,793 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:46,863 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:07:46,864 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 273 treesize of output 310 [2019-10-02 02:07:46,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:46,865 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:47,650 WARN L191 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2019-10-02 02:07:47,650 INFO L567 ElimStorePlain]: treesize reduction 48, result has 92.9 percent of original size [2019-10-02 02:07:47,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:47,756 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:07:48,116 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-02 02:07:48,117 INFO L341 Elim1Store]: treesize reduction 91, result has 64.0 percent of original size [2019-10-02 02:07:48,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 348 treesize of output 294 [2019-10-02 02:07:48,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,309 INFO L496 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 02:07:48,326 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:07:48,483 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-02 02:07:48,483 INFO L341 Elim1Store]: treesize reduction 15, result has 89.0 percent of original size [2019-10-02 02:07:48,484 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 7 case distinctions, treesize of input 283 treesize of output 234 [2019-10-02 02:07:48,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:07:48,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:48,565 INFO L496 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 02:07:49,567 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 152 DAG size of output: 114 [2019-10-02 02:07:49,568 INFO L567 ElimStorePlain]: treesize reduction 202, result has 59.6 percent of original size [2019-10-02 02:07:49,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:49,635 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:07:49,735 INFO L341 Elim1Store]: treesize reduction 40, result has 67.5 percent of original size [2019-10-02 02:07:49,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 157 treesize of output 192 [2019-10-02 02:07:49,737 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:49,762 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:07:49,828 INFO L341 Elim1Store]: treesize reduction 16, result has 78.4 percent of original size [2019-10-02 02:07:49,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 156 [2019-10-02 02:07:49,830 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-02 02:07:50,145 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2019-10-02 02:07:50,145 INFO L567 ElimStorePlain]: treesize reduction 74, result has 76.7 percent of original size [2019-10-02 02:07:50,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 5 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-10-02 02:07:50,157 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:732, output treesize:558 [2019-10-02 02:07:50,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,713 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 146 [2019-10-02 02:07:50,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:50,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:51,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:51,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:51,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:51,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:07:52,080 WARN L191 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 193 [2019-10-02 02:07:53,006 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2019-10-02 02:07:53,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 02:07:53,195 INFO L392 ElimStorePlain]: Different costs {6=[v_prenex_18], 9=[v_prenex_31, v_prenex_29], 11=[v_prenex_19, v_prenex_21, v_prenex_20, v_prenex_30, v_prenex_24, v_prenex_33, v_prenex_22, |v_#memory_int_74|, v_prenex_17, v_prenex_27], 17=[v_prenex_32, v_prenex_25, v_prenex_34, v_prenex_23], 19=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|], 27=[v_prenex_28, v_prenex_26]} [2019-10-02 02:07:53,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:07:53,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 135 [2019-10-02 02:07:53,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:06,304 WARN L191 SmtUtils]: Spent 12.97 s on a formula simplification. DAG size of input: 361 DAG size of output: 353 [2019-10-02 02:08:06,304 INFO L567 ElimStorePlain]: treesize reduction 40, result has 97.0 percent of original size [2019-10-02 02:08:06,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:06,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 130 [2019-10-02 02:08:06,579 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:12,070 WARN L191 SmtUtils]: Spent 5.49 s on a formula simplification that was a NOOP. DAG size: 348 [2019-10-02 02:08:12,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:12,199 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:12,199 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 121 [2019-10-02 02:08:12,201 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:21,255 WARN L191 SmtUtils]: Spent 9.05 s on a formula simplification. DAG size of input: 354 DAG size of output: 343 [2019-10-02 02:08:21,256 INFO L567 ElimStorePlain]: treesize reduction 96, result has 93.0 percent of original size [2019-10-02 02:08:21,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:21,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:21,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 121 [2019-10-02 02:08:21,449 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:25,406 WARN L191 SmtUtils]: Spent 3.96 s on a formula simplification that was a NOOP. DAG size: 338 [2019-10-02 02:08:25,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:25,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:25,461 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 0 case distinctions, treesize of input 178 treesize of output 172 [2019-10-02 02:08:25,461 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:28,659 WARN L191 SmtUtils]: Spent 3.20 s on a formula simplification that was a NOOP. DAG size: 330 [2019-10-02 02:08:28,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:28,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:28,749 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:08:28,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:28,765 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 3 case distinctions, treesize of input 161 treesize of output 127 [2019-10-02 02:08:28,766 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:34,098 WARN L191 SmtUtils]: Spent 5.33 s on a formula simplification. DAG size of input: 332 DAG size of output: 325 [2019-10-02 02:08:34,098 INFO L567 ElimStorePlain]: treesize reduction 88, result has 93.4 percent of original size [2019-10-02 02:08:34,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 97 [2019-10-02 02:08:34,133 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:36,423 WARN L191 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 317 [2019-10-02 02:08:36,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:36,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:36,519 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:36,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 207 treesize of output 311 [2019-10-02 02:08:36,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:08:36,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:08:36,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:08:36,523 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:42,450 WARN L191 SmtUtils]: Spent 5.93 s on a formula simplification. DAG size of input: 332 DAG size of output: 309 [2019-10-02 02:08:42,450 INFO L567 ElimStorePlain]: treesize reduction 276, result has 81.3 percent of original size [2019-10-02 02:08:42,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 166 [2019-10-02 02:08:42,478 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:44,150 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 301 [2019-10-02 02:08:44,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:44,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:44,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:44,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 140 [2019-10-02 02:08:44,233 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:45,623 WARN L191 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 294 [2019-10-02 02:08:45,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:45,648 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 0 case distinctions, treesize of input 229 treesize of output 223 [2019-10-02 02:08:45,648 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:46,800 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 286 [2019-10-02 02:08:46,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:46,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:46,847 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:08:46,857 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:46,857 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 101 [2019-10-02 02:08:46,858 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:48,779 WARN L191 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 288 DAG size of output: 280 [2019-10-02 02:08:48,779 INFO L567 ElimStorePlain]: treesize reduction 50, result has 95.8 percent of original size [2019-10-02 02:08:48,839 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:48,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 260 treesize of output 374 [2019-10-02 02:08:48,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:08:48,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:08:48,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:08:48,843 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:51,322 WARN L191 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 293 DAG size of output: 270 [2019-10-02 02:08:51,323 INFO L567 ElimStorePlain]: treesize reduction 290, result has 79.4 percent of original size [2019-10-02 02:08:51,400 INFO L341 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2019-10-02 02:08:51,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 157 [2019-10-02 02:08:51,402 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:52,755 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 273 DAG size of output: 263 [2019-10-02 02:08:52,755 INFO L567 ElimStorePlain]: treesize reduction 72, result has 93.8 percent of original size [2019-10-02 02:08:52,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:52,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:52,820 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:08:52,838 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:52,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 269 [2019-10-02 02:08:52,840 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:53,989 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 259 DAG size of output: 256 [2019-10-02 02:08:53,989 INFO L567 ElimStorePlain]: treesize reduction 46, result has 95.9 percent of original size [2019-10-02 02:08:54,032 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:54,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 130 [2019-10-02 02:08:54,033 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:55,068 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 255 DAG size of output: 251 [2019-10-02 02:08:55,069 INFO L567 ElimStorePlain]: treesize reduction 20, result has 98.1 percent of original size [2019-10-02 02:08:55,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:55,089 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:08:55,117 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:55,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 175 treesize of output 153 [2019-10-02 02:08:55,120 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:56,113 WARN L191 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 228 [2019-10-02 02:08:56,114 INFO L567 ElimStorePlain]: treesize reduction 228, result has 82.0 percent of original size [2019-10-02 02:08:56,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:56,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:56,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:08:56,202 INFO L341 Elim1Store]: treesize reduction 14, result has 78.5 percent of original size [2019-10-02 02:08:56,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 212 treesize of output 181 [2019-10-02 02:08:56,204 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:57,075 WARN L191 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 215 [2019-10-02 02:08:57,076 INFO L567 ElimStorePlain]: treesize reduction 164, result has 86.2 percent of original size [2019-10-02 02:08:57,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:57,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:57,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 204 [2019-10-02 02:08:57,109 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:57,848 WARN L191 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 205 [2019-10-02 02:08:57,849 INFO L567 ElimStorePlain]: treesize reduction 22, result has 97.9 percent of original size [2019-10-02 02:08:57,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:57,891 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:08:57,944 INFO L341 Elim1Store]: treesize reduction 36, result has 73.7 percent of original size [2019-10-02 02:08:57,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 243 treesize of output 343 [2019-10-02 02:08:57,946 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:58,623 WARN L191 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 197 [2019-10-02 02:08:58,623 INFO L567 ElimStorePlain]: treesize reduction 124, result has 88.9 percent of original size [2019-10-02 02:08:58,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:58,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:58,641 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:08:58,741 INFO L341 Elim1Store]: treesize reduction 28, result has 72.8 percent of original size [2019-10-02 02:08:58,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 228 treesize of output 207 [2019-10-02 02:08:58,745 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:59,386 WARN L191 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 179 [2019-10-02 02:08:59,386 INFO L567 ElimStorePlain]: treesize reduction 248, result has 79.8 percent of original size [2019-10-02 02:08:59,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 21 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2019-10-02 02:08:59,388 INFO L221 ElimStorePlain]: Needed 22 recursive calls to eliminate 27 variables, input treesize:1370, output treesize:981 [2019-10-02 02:09:00,074 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2019-10-02 02:09:00,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 02:09:00,096 INFO L392 ElimStorePlain]: Different costs {3=[v_prenex_40, v_prenex_35, v_prenex_46, v_prenex_45, v_prenex_38, v_prenex_37], 6=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 9=[v_prenex_50, v_prenex_43, v_prenex_42, v_prenex_52], 14=[v_prenex_49, v_prenex_48]} [2019-10-02 02:09:00,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:09:00,111 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 124 treesize of output 96 [2019-10-02 02:09:00,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:00,396 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 274 [2019-10-02 02:09:00,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:00,436 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:00,436 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 129 treesize of output 87 [2019-10-02 02:09:00,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:00,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:00,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:00,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:00,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:00,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:00,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:00,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:00,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:00,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:00,443 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:01,021 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 270 [2019-10-02 02:09:01,022 INFO L567 ElimStorePlain]: treesize reduction 20, result has 97.9 percent of original size [2019-10-02 02:09:01,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:09:01,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 80 [2019-10-02 02:09:01,037 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:01,313 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 259 [2019-10-02 02:09:01,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:01,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:01,333 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 2 case distinctions, treesize of input 71 treesize of output 58 [2019-10-02 02:09:01,334 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:01,871 WARN L191 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 249 [2019-10-02 02:09:01,872 INFO L567 ElimStorePlain]: treesize reduction 16, result has 98.2 percent of original size [2019-10-02 02:09:01,897 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:01,898 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 87 treesize of output 69 [2019-10-02 02:09:01,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:01,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:01,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:01,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:01,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:01,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:01,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:01,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:01,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:01,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:01,904 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:02,481 WARN L191 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 240 [2019-10-02 02:09:02,481 INFO L567 ElimStorePlain]: treesize reduction 20, result has 97.6 percent of original size [2019-10-02 02:09:02,492 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 58 treesize of output 42 [2019-10-02 02:09:02,493 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:02,732 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 229 [2019-10-02 02:09:02,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:02,770 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:02,770 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 151 treesize of output 128 [2019-10-02 02:09:02,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:02,785 INFO L496 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:03,423 WARN L191 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 230 [2019-10-02 02:09:03,423 INFO L567 ElimStorePlain]: treesize reduction 20, result has 97.4 percent of original size [2019-10-02 02:09:03,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:03,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 97 [2019-10-02 02:09:03,456 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:03,954 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 216 [2019-10-02 02:09:03,955 INFO L567 ElimStorePlain]: treesize reduction 8, result has 98.9 percent of original size [2019-10-02 02:09:04,013 INFO L341 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2019-10-02 02:09:04,014 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 116 [2019-10-02 02:09:04,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:04,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:04,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:04,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:04,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:04,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:04,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:04,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:04,019 INFO L496 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:04,532 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 211 [2019-10-02 02:09:04,533 INFO L567 ElimStorePlain]: treesize reduction 16, result has 97.4 percent of original size [2019-10-02 02:09:04,551 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:04,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 139 [2019-10-02 02:09:04,553 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:04,780 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2019-10-02 02:09:04,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:04,840 INFO L341 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2019-10-02 02:09:04,840 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 89 [2019-10-02 02:09:04,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:04,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:04,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:04,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:04,843 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:05,284 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 189 [2019-10-02 02:09:05,284 INFO L567 ElimStorePlain]: treesize reduction 16, result has 96.8 percent of original size [2019-10-02 02:09:05,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:05,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 68 [2019-10-02 02:09:05,303 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:05,508 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2019-10-02 02:09:05,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:05,576 INFO L341 Elim1Store]: treesize reduction 32, result has 74.0 percent of original size [2019-10-02 02:09:05,576 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 198 treesize of output 230 [2019-10-02 02:09:05,577 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:05,931 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 160 [2019-10-02 02:09:05,932 INFO L567 ElimStorePlain]: treesize reduction 22, result has 94.6 percent of original size [2019-10-02 02:09:06,020 INFO L341 Elim1Store]: treesize reduction 42, result has 58.4 percent of original size [2019-10-02 02:09:06,021 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 8 new quantified variables, introduced 10 case distinctions, treesize of input 125 treesize of output 116 [2019-10-02 02:09:06,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,031 INFO L496 ElimStorePlain]: Start of recursive call 15: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:06,421 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 144 [2019-10-02 02:09:06,422 INFO L567 ElimStorePlain]: treesize reduction 216, result has 58.1 percent of original size [2019-10-02 02:09:06,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 14 dim-2 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-10-02 02:09:06,432 INFO L221 ElimStorePlain]: Needed 15 recursive calls to eliminate 25 variables, input treesize:1048, output treesize:401 [2019-10-02 02:09:06,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,670 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 33 [2019-10-02 02:09:06,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:09:06,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:09:06,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2019-10-02 02:09:06,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 02:09:06,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 02:09:06,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-10-02 02:09:06,719 INFO L87 Difference]: Start difference. First operand 236 states and 311 transitions. Second operand 17 states. [2019-10-02 02:09:07,638 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 188 [2019-10-02 02:09:09,928 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 316 DAG size of output: 307 [2019-10-02 02:09:10,698 WARN L191 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 174 [2019-10-02 02:09:12,998 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 340 DAG size of output: 331 [2019-10-02 02:09:14,984 WARN L191 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 298 DAG size of output: 291 [2019-10-02 02:09:18,427 WARN L191 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 324 DAG size of output: 316 [2019-10-02 02:09:19,716 WARN L191 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 178 [2019-10-02 02:09:20,398 WARN L191 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 189 [2019-10-02 02:09:20,963 WARN L191 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 179 [2019-10-02 02:09:23,182 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 322 DAG size of output: 317 [2019-10-02 02:09:30,166 WARN L191 SmtUtils]: Spent 6.23 s on a formula simplification. DAG size of input: 306 DAG size of output: 302 [2019-10-02 02:09:31,510 WARN L191 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 164 [2019-10-02 02:09:32,481 WARN L191 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 175 [2019-10-02 02:09:33,093 WARN L191 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 165 [2019-10-02 02:09:33,637 WARN L191 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 173 [2019-10-02 02:09:34,476 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2019-10-02 02:09:34,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:09:34,541 INFO L93 Difference]: Finished difference Result 427 states and 570 transitions. [2019-10-02 02:09:34,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 02:09:34,542 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-10-02 02:09:34,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:09:34,544 INFO L225 Difference]: With dead ends: 427 [2019-10-02 02:09:34,544 INFO L226 Difference]: Without dead ends: 340 [2019-10-02 02:09:34,545 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 02:09:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-10-02 02:09:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 265. [2019-10-02 02:09:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-10-02 02:09:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 347 transitions. [2019-10-02 02:09:34,573 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 347 transitions. Word has length 32 [2019-10-02 02:09:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:09:34,573 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 347 transitions. [2019-10-02 02:09:34,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 02:09:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 347 transitions. [2019-10-02 02:09:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 02:09:34,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:09:34,575 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:09:34,575 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:09:34,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:09:34,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2008819857, now seen corresponding path program 4 times [2019-10-02 02:09:34,575 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:09:34,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:09:34,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:09:34,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:09:34,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:09:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:09:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:09:35,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:09:35,038 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:09:35,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 02:09:35,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 02:09:35,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:09:35,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-02 02:09:35,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:09:35,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:09:35,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:35,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:09:35,228 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:35,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 02:09:35,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,302 INFO L567 ElimStorePlain]: treesize reduction 14, result has 87.4 percent of original size [2019-10-02 02:09:35,309 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 38 treesize of output 17 [2019-10-02 02:09:35,309 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:35,335 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 38 treesize of output 17 [2019-10-02 02:09:35,335 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:35,356 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-02 02:09:35,356 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:99, output treesize:53 [2019-10-02 02:09:35,423 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:35,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-10-02 02:09:35,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:35,511 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_75|], 10=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_43|]} [2019-10-02 02:09:35,521 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-02 02:09:35,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:35,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 36 [2019-10-02 02:09:35,597 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:35,635 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:09:35,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:35,670 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 4 case distinctions, treesize of input 105 treesize of output 87 [2019-10-02 02:09:35,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:35,671 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,731 INFO L567 ElimStorePlain]: treesize reduction 84, result has 48.1 percent of original size [2019-10-02 02:09:35,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,732 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:201, output treesize:111 [2019-10-02 02:09:35,818 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_76|], 9=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_44|]} [2019-10-02 02:09:35,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-10-02 02:09:35,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:35,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:09:35,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2019-10-02 02:09:35,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:35,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:35,901 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 3 case distinctions, treesize of input 100 treesize of output 84 [2019-10-02 02:09:35,902 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,944 INFO L567 ElimStorePlain]: treesize reduction 96, result has 49.7 percent of original size [2019-10-02 02:09:35,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:09:35,945 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:95 [2019-10-02 02:09:35,992 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_77|], 9=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_45|]} [2019-10-02 02:09:35,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-10-02 02:09:35,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:36,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:36,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:09:36,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:36,054 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 3 case distinctions, treesize of input 107 treesize of output 87 [2019-10-02 02:09:36,055 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:36,112 INFO L567 ElimStorePlain]: treesize reduction 40, result has 69.9 percent of original size [2019-10-02 02:09:36,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:09:36,129 INFO L341 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2019-10-02 02:09:36,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2019-10-02 02:09:36,130 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:36,174 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.9 percent of original size [2019-10-02 02:09:36,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:36,175 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:153, output treesize:74 [2019-10-02 02:09:36,205 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:09:36,242 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-10-02 02:09:36,243 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 82 [2019-10-02 02:09:36,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:36,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:36,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:36,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:36,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:36,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:36,247 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:36,286 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.0 percent of original size [2019-10-02 02:09:36,294 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:36,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2019-10-02 02:09:36,295 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:36,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:36,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:09:36,305 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:11 [2019-10-02 02:09:36,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:09:36,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:09:36,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-10-02 02:09:36,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 02:09:36,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 02:09:36,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-10-02 02:09:36,345 INFO L87 Difference]: Start difference. First operand 265 states and 347 transitions. Second operand 17 states. [2019-10-02 02:09:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:09:37,923 INFO L93 Difference]: Finished difference Result 387 states and 515 transitions. [2019-10-02 02:09:37,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 02:09:37,926 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-10-02 02:09:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:09:37,929 INFO L225 Difference]: With dead ends: 387 [2019-10-02 02:09:37,929 INFO L226 Difference]: Without dead ends: 385 [2019-10-02 02:09:37,930 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=207, Invalid=1125, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 02:09:37,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-10-02 02:09:37,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 347. [2019-10-02 02:09:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-02 02:09:37,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 472 transitions. [2019-10-02 02:09:37,966 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 472 transitions. Word has length 34 [2019-10-02 02:09:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:09:37,966 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 472 transitions. [2019-10-02 02:09:37,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 02:09:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 472 transitions. [2019-10-02 02:09:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 02:09:37,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:09:37,967 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:09:37,968 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:09:37,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:09:37,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2008817935, now seen corresponding path program 4 times [2019-10-02 02:09:37,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:09:37,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:09:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:09:37,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:09:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:09:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:09:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:09:38,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:09:38,441 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:09:38,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 02:09:38,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 02:09:38,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:09:38,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-02 02:09:38,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:09:38,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:09:38,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:38,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:38,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:09:38,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:09:38,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:38,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 02:09:38,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:38,684 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.4 percent of original size [2019-10-02 02:09:38,698 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 34 treesize of output 15 [2019-10-02 02:09:38,698 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:38,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:38,723 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 34 treesize of output 15 [2019-10-02 02:09:38,723 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:38,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:38,743 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-02 02:09:38,743 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:91, output treesize:49 [2019-10-02 02:09:38,810 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:38,810 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 20 treesize of output 30 [2019-10-02 02:09:38,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:38,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:38,880 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_78|], 5=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_47|]} [2019-10-02 02:09:38,886 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-02 02:09:38,886 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:38,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:38,978 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:38,978 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 4 case distinctions, treesize of input 139 treesize of output 117 [2019-10-02 02:09:38,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:38,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:38,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:38,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:38,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:38,982 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:39,057 INFO L567 ElimStorePlain]: treesize reduction 173, result has 39.7 percent of original size [2019-10-02 02:09:39,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:09:39,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 51 [2019-10-02 02:09:39,062 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:39,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:39,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:09:39,085 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:175, output treesize:95 [2019-10-02 02:09:39,164 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_79|], 9=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_48|]} [2019-10-02 02:09:39,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-10-02 02:09:39,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:39,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:39,241 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:39,242 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 3 case distinctions, treesize of input 100 treesize of output 84 [2019-10-02 02:09:39,243 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:39,311 INFO L567 ElimStorePlain]: treesize reduction 72, result has 60.4 percent of original size [2019-10-02 02:09:39,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:09:39,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2019-10-02 02:09:39,317 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:39,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:39,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:09:39,336 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:95 [2019-10-02 02:09:39,377 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_80|], 9=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_49|]} [2019-10-02 02:09:39,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-10-02 02:09:39,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:39,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:39,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:09:39,437 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:39,438 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 3 case distinctions, treesize of input 107 treesize of output 87 [2019-10-02 02:09:39,439 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:39,504 INFO L567 ElimStorePlain]: treesize reduction 72, result has 62.7 percent of original size [2019-10-02 02:09:39,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:09:39,522 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:39,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 70 [2019-10-02 02:09:39,523 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:39,571 INFO L567 ElimStorePlain]: treesize reduction 24, result has 81.0 percent of original size [2019-10-02 02:09:39,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:39,573 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:153, output treesize:102 [2019-10-02 02:09:39,606 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:09:39,643 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-10-02 02:09:39,644 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 82 [2019-10-02 02:09:39,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:39,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:39,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:39,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:39,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:39,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:39,647 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:39,685 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.0 percent of original size [2019-10-02 02:09:39,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:39,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2019-10-02 02:09:39,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:39,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:39,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:09:39,703 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:11 [2019-10-02 02:09:39,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:09:39,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:09:39,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-10-02 02:09:39,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 02:09:39,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 02:09:39,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-02 02:09:39,739 INFO L87 Difference]: Start difference. First operand 347 states and 472 transitions. Second operand 17 states. [2019-10-02 02:09:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:09:41,464 INFO L93 Difference]: Finished difference Result 666 states and 943 transitions. [2019-10-02 02:09:41,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 02:09:41,466 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-10-02 02:09:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:09:41,468 INFO L225 Difference]: With dead ends: 666 [2019-10-02 02:09:41,468 INFO L226 Difference]: Without dead ends: 523 [2019-10-02 02:09:41,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 02:09:41,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-10-02 02:09:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 474. [2019-10-02 02:09:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-02 02:09:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 663 transitions. [2019-10-02 02:09:41,506 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 663 transitions. Word has length 34 [2019-10-02 02:09:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:09:41,507 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 663 transitions. [2019-10-02 02:09:41,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 02:09:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 663 transitions. [2019-10-02 02:09:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 02:09:41,508 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:09:41,508 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:09:41,508 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:09:41,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:09:41,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2103255125, now seen corresponding path program 4 times [2019-10-02 02:09:41,508 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:09:41,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:09:41,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:09:41,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:09:41,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:09:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:09:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:09:41,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:09:41,723 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:09:41,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 02:09:41,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 02:09:41,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:09:41,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-02 02:09:41,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:09:41,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:09:41,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:41,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:41,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:09:41,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:09:41,965 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:41,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 02:09:41,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:42,001 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.6 percent of original size [2019-10-02 02:09:42,015 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 02:09:42,015 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 1 case distinctions, treesize of input 40 treesize of output 19 [2019-10-02 02:09:42,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:42,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:42,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:42,028 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:36 [2019-10-02 02:09:42,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:42,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-10-02 02:09:42,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:42,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:42,275 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-10-02 02:09:42,276 INFO L341 Elim1Store]: treesize reduction 174, result has 43.9 percent of original size [2019-10-02 02:09:42,276 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 5 case distinctions, treesize of input 100 treesize of output 150 [2019-10-02 02:09:42,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:09:42,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,278 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:42,373 INFO L567 ElimStorePlain]: treesize reduction 178, result has 38.6 percent of original size [2019-10-02 02:09:42,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:42,375 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:114, output treesize:160 [2019-10-02 02:09:42,511 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_81|], 12=[|v_#memory_$Pointer$.base_52|]} [2019-10-02 02:09:42,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-02 02:09:42,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:42,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:42,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:09:42,649 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-10-02 02:09:42,650 INFO L341 Elim1Store]: treesize reduction 48, result has 64.4 percent of original size [2019-10-02 02:09:42,650 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 5 case distinctions, treesize of input 85 treesize of output 117 [2019-10-02 02:09:42,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,656 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:42,713 INFO L567 ElimStorePlain]: treesize reduction 98, result has 39.9 percent of original size [2019-10-02 02:09:42,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:42,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:86 [2019-10-02 02:09:42,782 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:42,783 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 79 treesize of output 73 [2019-10-02 02:09:42,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,786 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:42,812 INFO L567 ElimStorePlain]: treesize reduction 48, result has 32.4 percent of original size [2019-10-02 02:09:42,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:09:42,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:15 [2019-10-02 02:09:42,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-10-02 02:09:42,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:42,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:42,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:09:42,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:11 [2019-10-02 02:09:42,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:09:42,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:09:42,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-10-02 02:09:42,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 02:09:42,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 02:09:42,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2019-10-02 02:09:42,906 INFO L87 Difference]: Start difference. First operand 474 states and 663 transitions. Second operand 22 states. [2019-10-02 02:09:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:09:45,053 INFO L93 Difference]: Finished difference Result 1230 states and 1735 transitions. [2019-10-02 02:09:45,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 02:09:45,053 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2019-10-02 02:09:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:09:45,059 INFO L225 Difference]: With dead ends: 1230 [2019-10-02 02:09:45,059 INFO L226 Difference]: Without dead ends: 991 [2019-10-02 02:09:45,060 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=562, Invalid=1988, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 02:09:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-10-02 02:09:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 766. [2019-10-02 02:09:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-10-02 02:09:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1076 transitions. [2019-10-02 02:09:45,125 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1076 transitions. Word has length 36 [2019-10-02 02:09:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:09:45,125 INFO L475 AbstractCegarLoop]: Abstraction has 766 states and 1076 transitions. [2019-10-02 02:09:45,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 02:09:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1076 transitions. [2019-10-02 02:09:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 02:09:45,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:09:45,126 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:09:45,127 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:09:45,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:09:45,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1382363623, now seen corresponding path program 2 times [2019-10-02 02:09:45,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:09:45,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:09:45,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:09:45,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:09:45,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:09:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:09:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:09:45,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:09:45,446 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:09:45,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 02:09:45,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 02:09:45,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:09:45,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 02:09:45,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:09:45,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:09:45,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:45,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:45,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:09:45,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:09:45,661 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:45,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 02:09:45,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:45,702 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.6 percent of original size [2019-10-02 02:09:45,717 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 02:09:45,717 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 1 case distinctions, treesize of input 40 treesize of output 19 [2019-10-02 02:09:45,717 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:45,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:45,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:45,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:36 [2019-10-02 02:09:45,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:45,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-10-02 02:09:45,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:45,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:45,988 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-10-02 02:09:45,989 INFO L341 Elim1Store]: treesize reduction 174, result has 43.9 percent of original size [2019-10-02 02:09:45,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 150 [2019-10-02 02:09:45,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:09:45,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:09:45,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:45,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:45,992 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:46,083 INFO L567 ElimStorePlain]: treesize reduction 112, result has 50.0 percent of original size [2019-10-02 02:09:46,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:46,085 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:114, output treesize:160 [2019-10-02 02:09:46,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,339 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_83|], 12=[|v_#memory_$Pointer$.base_55|]} [2019-10-02 02:09:46,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-02 02:09:46,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:46,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:46,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:09:46,518 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-10-02 02:09:46,519 INFO L341 Elim1Store]: treesize reduction 48, result has 64.4 percent of original size [2019-10-02 02:09:46,519 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 5 case distinctions, treesize of input 85 treesize of output 117 [2019-10-02 02:09:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,524 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:46,581 INFO L567 ElimStorePlain]: treesize reduction 98, result has 39.9 percent of original size [2019-10-02 02:09:46,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:46,582 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:86 [2019-10-02 02:09:46,660 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:46,660 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 79 treesize of output 73 [2019-10-02 02:09:46,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,665 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:46,691 INFO L567 ElimStorePlain]: treesize reduction 48, result has 32.4 percent of original size [2019-10-02 02:09:46,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:09:46,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:15 [2019-10-02 02:09:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:46,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-10-02 02:09:46,732 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:46,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2019-10-02 02:09:46,742 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:46,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2019-10-02 02:09:46,746 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:46,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:46,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-10-02 02:09:46,796 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:133, output treesize:93 [2019-10-02 02:10:20,966 WARN L191 SmtUtils]: Spent 30.13 s on a formula simplification that was a NOOP. DAG size: 56 [2019-10-02 02:10:47,117 WARN L191 SmtUtils]: Spent 24.10 s on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-10-02 02:10:47,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:10:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:10:47,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:10:47,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2019-10-02 02:10:47,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 02:10:47,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 02:10:47,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=477, Unknown=3, NotChecked=0, Total=552 [2019-10-02 02:10:47,140 INFO L87 Difference]: Start difference. First operand 766 states and 1076 transitions. Second operand 24 states. [2019-10-02 02:11:57,779 WARN L191 SmtUtils]: Spent 31.35 s on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-10-02 02:12:52,170 WARN L191 SmtUtils]: Spent 42.16 s on a formula simplification that was a NOOP. DAG size: 75 [2019-10-02 02:13:42,753 WARN L191 SmtUtils]: Spent 46.35 s on a formula simplification that was a NOOP. DAG size: 76 [2019-10-02 02:14:01,064 WARN L191 SmtUtils]: Spent 12.05 s on a formula simplification that was a NOOP. DAG size: 49 [2019-10-02 02:14:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:14:03,442 INFO L93 Difference]: Finished difference Result 1545 states and 2221 transitions. [2019-10-02 02:14:03,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 02:14:03,443 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2019-10-02 02:14:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:14:03,447 INFO L225 Difference]: With dead ends: 1545 [2019-10-02 02:14:03,447 INFO L226 Difference]: Without dead ends: 979 [2019-10-02 02:14:03,448 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 217.9s TimeCoverageRelationStatistics Valid=330, Invalid=2307, Unknown=15, NotChecked=0, Total=2652 [2019-10-02 02:14:03,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-10-02 02:14:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 855. [2019-10-02 02:14:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-10-02 02:14:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1187 transitions. [2019-10-02 02:14:03,507 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1187 transitions. Word has length 36 [2019-10-02 02:14:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:14:03,507 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1187 transitions. [2019-10-02 02:14:03,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 02:14:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1187 transitions. [2019-10-02 02:14:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 02:14:03,508 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:14:03,508 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:14:03,508 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:14:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:14:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash -189124082, now seen corresponding path program 5 times [2019-10-02 02:14:03,509 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:14:03,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:14:03,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:14:03,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:14:03,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:14:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:14:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:14:04,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:14:04,076 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:14:04,187 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 02:14:04,259 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-02 02:14:04,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:14:04,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-02 02:14:04,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:14:04,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:04,267 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 20 treesize of output 9 [2019-10-02 02:14:04,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:04,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:04,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:04,284 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 20 treesize of output 9 [2019-10-02 02:14:04,284 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:04,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:04,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:14:04,291 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:25 [2019-10-02 02:14:04,325 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:14:04,415 INFO L341 Elim1Store]: treesize reduction 54, result has 60.6 percent of original size [2019-10-02 02:14:04,416 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 2 case distinctions, treesize of input 48 treesize of output 93 [2019-10-02 02:14:04,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:04,512 INFO L567 ElimStorePlain]: treesize reduction 37, result has 73.6 percent of original size [2019-10-02 02:14:04,517 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:14:04,584 INFO L341 Elim1Store]: treesize reduction 83, result has 39.4 percent of original size [2019-10-02 02:14:04,585 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 2 case distinctions, treesize of input 48 treesize of output 64 [2019-10-02 02:14:04,585 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:04,672 INFO L567 ElimStorePlain]: treesize reduction 25, result has 78.4 percent of original size [2019-10-02 02:14:04,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:14:04,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:14:04,677 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:143 [2019-10-02 02:14:04,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:04,975 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_52|], 11=[|v_#memory_$Pointer$.base_58|]} [2019-10-02 02:14:04,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:04,985 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 56 treesize of output 44 [2019-10-02 02:14:04,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:04,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:04,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:04,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:14:05,002 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:05,003 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 75 treesize of output 80 [2019-10-02 02:14:05,004 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,096 INFO L567 ElimStorePlain]: treesize reduction 24, result has 81.0 percent of original size [2019-10-02 02:14:05,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:05,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:05,117 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:14:05,123 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:05,123 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 60 treesize of output 56 [2019-10-02 02:14:05,124 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:05,130 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 41 treesize of output 29 [2019-10-02 02:14:05,130 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,193 INFO L567 ElimStorePlain]: treesize reduction 30, result has 70.6 percent of original size [2019-10-02 02:14:05,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 02:14:05,194 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:132, output treesize:72 [2019-10-02 02:14:05,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:05,379 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_85|], 6=[|v_#memory_$Pointer$.base_59|, |v_#memory_$Pointer$.offset_53|]} [2019-10-02 02:14:05,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 25 [2019-10-02 02:14:05,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:05,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:05,416 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:14:05,421 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:05,421 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 146 treesize of output 105 [2019-10-02 02:14:05,422 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,461 INFO L567 ElimStorePlain]: treesize reduction 30, result has 79.0 percent of original size [2019-10-02 02:14:05,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:05,480 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:05,480 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 87 treesize of output 100 [2019-10-02 02:14:05,481 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:05,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,496 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:205, output treesize:62 [2019-10-02 02:14:05,569 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_60|, |v_#memory_$Pointer$.offset_54|], 6=[|v_#memory_int_86|]} [2019-10-02 02:14:05,577 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:05,577 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 57 treesize of output 47 [2019-10-02 02:14:05,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,623 INFO L567 ElimStorePlain]: treesize reduction 24, result has 77.8 percent of original size [2019-10-02 02:14:05,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:05,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-10-02 02:14:05,630 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:05,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:05,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-10-02 02:14:05,655 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:05,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,670 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:99, output treesize:52 [2019-10-02 02:14:05,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:05,679 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-02 02:14:05,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,706 INFO L567 ElimStorePlain]: treesize reduction 4, result has 90.2 percent of original size [2019-10-02 02:14:05,709 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-02 02:14:05,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:05,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:14:05,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:15 [2019-10-02 02:14:05,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:14:05,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:14:05,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-10-02 02:14:05,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 02:14:05,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 02:14:05,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-10-02 02:14:05,761 INFO L87 Difference]: Start difference. First operand 855 states and 1187 transitions. Second operand 23 states. [2019-10-02 02:14:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:14:07,396 INFO L93 Difference]: Finished difference Result 1480 states and 2076 transitions. [2019-10-02 02:14:07,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 02:14:07,396 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2019-10-02 02:14:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:14:07,400 INFO L225 Difference]: With dead ends: 1480 [2019-10-02 02:14:07,400 INFO L226 Difference]: Without dead ends: 1205 [2019-10-02 02:14:07,401 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 02:14:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2019-10-02 02:14:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1057. [2019-10-02 02:14:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2019-10-02 02:14:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1446 transitions. [2019-10-02 02:14:07,478 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1446 transitions. Word has length 38 [2019-10-02 02:14:07,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:14:07,479 INFO L475 AbstractCegarLoop]: Abstraction has 1057 states and 1446 transitions. [2019-10-02 02:14:07,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 02:14:07,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1446 transitions. [2019-10-02 02:14:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 02:14:07,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:14:07,480 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:14:07,481 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:14:07,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:14:07,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1200243254, now seen corresponding path program 3 times [2019-10-02 02:14:07,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:14:07,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:14:07,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:14:07,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:14:07,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:14:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:14:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:14:08,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:14:08,086 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:14:08,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 02:14:08,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 02:14:08,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:14:08,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-02 02:14:08,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:14:08,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:14:08,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:08,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:08,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:14:08,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:14:08,298 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:08,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 02:14:08,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:08,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:08,322 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 02:14:08,322 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 1 case distinctions, treesize of input 36 treesize of output 17 [2019-10-02 02:14:08,323 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:08,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:08,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:14:08,331 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:25 [2019-10-02 02:14:08,384 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_55|], 6=[|v_#memory_$Pointer$.base_62|]} [2019-10-02 02:14:08,387 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 15 treesize of output 1 [2019-10-02 02:14:08,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:08,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:08,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:08,445 INFO L341 Elim1Store]: treesize reduction 24, result has 58.6 percent of original size [2019-10-02 02:14:08,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 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 51 [2019-10-02 02:14:08,446 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:08,471 INFO L567 ElimStorePlain]: treesize reduction 36, result has 46.3 percent of original size [2019-10-02 02:14:08,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:14:08,472 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:31 [2019-10-02 02:14:08,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:08,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:08,577 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_56|, |v_#memory_int_87|], 12=[|v_#memory_$Pointer$.base_63|]} [2019-10-02 02:14:08,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:08,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 154 [2019-10-02 02:14:08,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:08,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:08,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 156 [2019-10-02 02:14:08,604 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:08,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:14:08,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 172 [2019-10-02 02:14:08,612 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:08,682 INFO L567 ElimStorePlain]: treesize reduction 356, result has 27.6 percent of original size [2019-10-02 02:14:08,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 25 [2019-10-02 02:14:08,687 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:14:08,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:08,708 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 02:14:08,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:08,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 260 [2019-10-02 02:14:08,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:08,802 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:08,858 INFO L567 ElimStorePlain]: treesize reduction 223, result has 22.6 percent of original size [2019-10-02 02:14:08,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:14:08,859 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:627, output treesize:38 [2019-10-02 02:14:14,893 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_57|, |v_#memory_$Pointer$.base_64|], 6=[|v_#memory_int_88|]} [2019-10-02 02:14:14,898 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 33 treesize of output 21 [2019-10-02 02:14:14,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:14,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:14,919 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 41 treesize of output 25 [2019-10-02 02:14:14,920 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:14,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:14,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-10-02 02:14:14,938 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:14,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:14,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:14:14,948 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:79, output treesize:32 [2019-10-02 02:14:14,952 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 33 treesize of output 21 [2019-10-02 02:14:14,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:14,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:14,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-10-02 02:14:14,963 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:14:14,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:14:14,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:14:14,971 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:13 [2019-10-02 02:14:20,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:14:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:14:20,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:14:20,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2019-10-02 02:14:20,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 02:14:20,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 02:14:20,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=344, Unknown=6, NotChecked=0, Total=420 [2019-10-02 02:14:20,913 INFO L87 Difference]: Start difference. First operand 1057 states and 1446 transitions. Second operand 21 states. [2019-10-02 02:14:36,264 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 50 DAG size of output: 39