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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:57:28,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:57:28,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:57:28,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:57:28,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:57:28,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:57:28,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:57:28,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:57:28,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:57:28,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:57:28,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:57:28,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:57:28,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:57:28,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:57:28,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:57:28,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:57:28,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:57:28,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:57:28,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:57:28,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:57:28,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:57:28,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:57:28,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:57:28,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:57:28,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:57:28,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:57:28,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:57:28,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:57:28,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:57:28,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:57:28,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:57:28,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:57:28,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:57:28,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:57:28,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:57:28,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:57:28,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:57:28,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:57:28,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:57:28,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:57:28,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:57:28,765 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:57:28,796 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:57:28,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:57:28,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:57:28,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:57:28,802 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:57:28,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:57:28,802 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:57:28,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:57:28,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:57:28,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:57:28,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:57:28,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:57:28,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:57:28,804 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:57:28,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:57:28,804 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:57:28,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:57:28,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:57:28,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:57:28,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:57:28,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:57:28,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:57:28,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:57:28,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:57:28,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:57:28,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:57:28,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:57:28,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:57:28,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:57:29,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:57:29,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:57:29,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:57:29,110 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:57:29,110 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:57:29,111 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i [2019-10-13 21:57:29,185 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/182ab2a0d/be0e319f70004e678f23fa4e4d314a0a/FLAG1d11a5d98 [2019-10-13 21:57:29,758 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:57:29,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i [2019-10-13 21:57:29,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/182ab2a0d/be0e319f70004e678f23fa4e4d314a0a/FLAG1d11a5d98 [2019-10-13 21:57:30,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/182ab2a0d/be0e319f70004e678f23fa4e4d314a0a [2019-10-13 21:57:30,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:57:30,157 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:57:30,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:57:30,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:57:30,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:57:30,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:30" (1/1) ... [2019-10-13 21:57:30,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47dc5e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:30, skipping insertion in model container [2019-10-13 21:57:30,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:30" (1/1) ... [2019-10-13 21:57:30,173 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:57:30,236 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:57:30,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:57:30,841 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:57:30,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:57:31,012 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:57:31,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:31 WrapperNode [2019-10-13 21:57:31,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:57:31,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:57:31,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:57:31,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:57:31,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:31" (1/1) ... [2019-10-13 21:57:31,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:31" (1/1) ... [2019-10-13 21:57:31,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:31" (1/1) ... [2019-10-13 21:57:31,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:31" (1/1) ... [2019-10-13 21:57:31,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:31" (1/1) ... [2019-10-13 21:57:31,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:31" (1/1) ... [2019-10-13 21:57:31,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:31" (1/1) ... [2019-10-13 21:57:31,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:57:31,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:57:31,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:57:31,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:57:31,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:57:31,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:57:31,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:57:31,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 21:57:31,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 21:57:31,205 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-10-13 21:57:31,206 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2019-10-13 21:57:31,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2019-10-13 21:57:31,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2019-10-13 21:57:31,207 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2019-10-13 21:57:31,208 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2019-10-13 21:57:31,208 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2019-10-13 21:57:31,209 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2019-10-13 21:57:31,209 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2019-10-13 21:57:31,209 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2019-10-13 21:57:31,210 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2019-10-13 21:57:31,210 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2019-10-13 21:57:31,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:57:31,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:57:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 21:57:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 21:57:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 21:57:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 21:57:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 21:57:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 21:57:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 21:57:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 21:57:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 21:57:31,215 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 21:57:31,215 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 21:57:31,215 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 21:57:31,215 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 21:57:31,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 21:57:31,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 21:57:31,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 21:57:31,216 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 21:57:31,217 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 21:57:31,217 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 21:57:31,217 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 21:57:31,217 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 21:57:31,217 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 21:57:31,217 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 21:57:31,218 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 21:57:31,218 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 21:57:31,218 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 21:57:31,218 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 21:57:31,218 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 21:57:31,218 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 21:57:31,219 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 21:57:31,219 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 21:57:31,219 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 21:57:31,219 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 21:57:31,219 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 21:57:31,219 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 21:57:31,220 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 21:57:31,220 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 21:57:31,220 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 21:57:31,220 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 21:57:31,220 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 21:57:31,221 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 21:57:31,221 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 21:57:31,222 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 21:57:31,222 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 21:57:31,222 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 21:57:31,222 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 21:57:31,222 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 21:57:31,222 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 21:57:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 21:57:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 21:57:31,224 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 21:57:31,224 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 21:57:31,224 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:57:31,224 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 21:57:31,224 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 21:57:31,225 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:57:31,225 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 21:57:31,225 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 21:57:31,226 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 21:57:31,226 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 21:57:31,226 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 21:57:31,226 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 21:57:31,227 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 21:57:31,227 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:57:31,227 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 21:57:31,227 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 21:57:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 21:57:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 21:57:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 21:57:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 21:57:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 21:57:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 21:57:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 21:57:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 21:57:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 21:57:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 21:57:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 21:57:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 21:57:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 21:57:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 21:57:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 21:57:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 21:57:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 21:57:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 21:57:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 21:57:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 21:57:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 21:57:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 21:57:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 21:57:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 21:57:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 21:57:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 21:57:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 21:57:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 21:57:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 21:57:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 21:57:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 21:57:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 21:57:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 21:57:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 21:57:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 21:57:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 21:57:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2019-10-13 21:57:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2019-10-13 21:57:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2019-10-13 21:57:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2019-10-13 21:57:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2019-10-13 21:57:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2019-10-13 21:57:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2019-10-13 21:57:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2019-10-13 21:57:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2019-10-13 21:57:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2019-10-13 21:57:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2019-10-13 21:57:31,237 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2019-10-13 21:57:31,237 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2019-10-13 21:57:31,238 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2019-10-13 21:57:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2019-10-13 21:57:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2019-10-13 21:57:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2019-10-13 21:57:31,242 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2019-10-13 21:57:31,242 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2019-10-13 21:57:31,243 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2019-10-13 21:57:31,243 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2019-10-13 21:57:31,243 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2019-10-13 21:57:31,243 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2019-10-13 21:57:31,244 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2019-10-13 21:57:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2019-10-13 21:57:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2019-10-13 21:57:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2019-10-13 21:57:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2019-10-13 21:57:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2019-10-13 21:57:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2019-10-13 21:57:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2019-10-13 21:57:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2019-10-13 21:57:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2019-10-13 21:57:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2019-10-13 21:57:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2019-10-13 21:57:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2019-10-13 21:57:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2019-10-13 21:57:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2019-10-13 21:57:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:57:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-10-13 21:57:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2019-10-13 21:57:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2019-10-13 21:57:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2019-10-13 21:57:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-13 21:57:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2019-10-13 21:57:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2019-10-13 21:57:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2019-10-13 21:57:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2019-10-13 21:57:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2019-10-13 21:57:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2019-10-13 21:57:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2019-10-13 21:57:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2019-10-13 21:57:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2019-10-13 21:57:31,256 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2019-10-13 21:57:31,256 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2019-10-13 21:57:31,256 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2019-10-13 21:57:31,256 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2019-10-13 21:57:31,256 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2019-10-13 21:57:31,256 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2019-10-13 21:57:31,257 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2019-10-13 21:57:31,257 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2019-10-13 21:57:31,257 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2019-10-13 21:57:31,257 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2019-10-13 21:57:31,257 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2019-10-13 21:57:31,257 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2019-10-13 21:57:31,258 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2019-10-13 21:57:31,258 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2019-10-13 21:57:31,258 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2019-10-13 21:57:31,258 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2019-10-13 21:57:31,258 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2019-10-13 21:57:31,258 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2019-10-13 21:57:31,259 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2019-10-13 21:57:31,259 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2019-10-13 21:57:31,259 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-13 21:57:31,259 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2019-10-13 21:57:31,259 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2019-10-13 21:57:31,259 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2019-10-13 21:57:31,259 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2019-10-13 21:57:31,260 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2019-10-13 21:57:31,260 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2019-10-13 21:57:31,260 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2019-10-13 21:57:31,260 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2019-10-13 21:57:31,260 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2019-10-13 21:57:31,260 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2019-10-13 21:57:31,261 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2019-10-13 21:57:31,261 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2019-10-13 21:57:31,261 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2019-10-13 21:57:31,261 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2019-10-13 21:57:31,261 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2019-10-13 21:57:31,261 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2019-10-13 21:57:31,262 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2019-10-13 21:57:31,262 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2019-10-13 21:57:31,262 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2019-10-13 21:57:31,262 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2019-10-13 21:57:31,262 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2019-10-13 21:57:31,262 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2019-10-13 21:57:31,263 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2019-10-13 21:57:31,263 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2019-10-13 21:57:31,263 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2019-10-13 21:57:31,263 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2019-10-13 21:57:31,263 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2019-10-13 21:57:31,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:57:31,264 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-10-13 21:57:31,264 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2019-10-13 21:57:31,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:57:31,264 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2019-10-13 21:57:31,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:57:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2019-10-13 21:57:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2019-10-13 21:57:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2019-10-13 21:57:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2019-10-13 21:57:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:57:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:57:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2019-10-13 21:57:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2019-10-13 21:57:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:57:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2019-10-13 21:57:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:57:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2019-10-13 21:57:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2019-10-13 21:57:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:57:31,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:57:31,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:57:31,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-13 21:57:31,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:57:32,235 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:57:32,236 INFO L284 CfgBuilder]: Removed 41 assume(true) statements. [2019-10-13 21:57:32,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:32 BoogieIcfgContainer [2019-10-13 21:57:32,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:57:32,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:57:32,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:57:32,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:57:32,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:57:30" (1/3) ... [2019-10-13 21:57:32,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718126f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:32, skipping insertion in model container [2019-10-13 21:57:32,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:31" (2/3) ... [2019-10-13 21:57:32,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718126f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:32, skipping insertion in model container [2019-10-13 21:57:32,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:32" (3/3) ... [2019-10-13 21:57:32,248 INFO L109 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2019-10-13 21:57:32,257 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:57:32,266 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:57:32,278 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:57:32,316 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:57:32,316 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:57:32,316 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:57:32,316 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:57:32,317 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:57:32,317 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:57:32,317 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:57:32,317 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:57:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2019-10-13 21:57:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:57:32,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:32,356 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:32,360 INFO L410 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:32,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2063377772, now seen corresponding path program 1 times [2019-10-13 21:57:32,375 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:32,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018079553] [2019-10-13 21:57:32,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:32,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:32,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:32,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018079553] [2019-10-13 21:57:32,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:57:32,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 21:57:32,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415925611] [2019-10-13 21:57:32,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:57:32,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:32,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:57:32,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:57:32,542 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 2 states. [2019-10-13 21:57:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:32,590 INFO L93 Difference]: Finished difference Result 258 states and 425 transitions. [2019-10-13 21:57:32,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:57:32,591 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-13 21:57:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:32,602 INFO L225 Difference]: With dead ends: 258 [2019-10-13 21:57:32,602 INFO L226 Difference]: Without dead ends: 120 [2019-10-13 21:57:32,608 INFO L600 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-13 21:57:32,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-13 21:57:32,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-10-13 21:57:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-13 21:57:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2019-10-13 21:57:32,657 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 13 [2019-10-13 21:57:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:32,657 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2019-10-13 21:57:32,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:57:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2019-10-13 21:57:32,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:57:32,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:32,659 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:32,660 INFO L410 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:32,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:32,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1695892571, now seen corresponding path program 1 times [2019-10-13 21:57:32,660 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:32,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65309830] [2019-10-13 21:57:32,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:32,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:32,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:32,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65309830] [2019-10-13 21:57:32,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:57:32,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:57:32,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535779836] [2019-10-13 21:57:32,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:57:32,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:32,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:57:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:57:32,864 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand 5 states. [2019-10-13 21:57:33,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:33,056 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-10-13 21:57:33,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:57:33,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-13 21:57:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:33,061 INFO L225 Difference]: With dead ends: 122 [2019-10-13 21:57:33,061 INFO L226 Difference]: Without dead ends: 119 [2019-10-13 21:57:33,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:57:33,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-13 21:57:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-10-13 21:57:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-13 21:57:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2019-10-13 21:57:33,082 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 28 [2019-10-13 21:57:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:33,084 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2019-10-13 21:57:33,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:57:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2019-10-13 21:57:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:57:33,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:33,086 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:33,086 INFO L410 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:33,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:33,087 INFO L82 PathProgramCache]: Analyzing trace with hash 368229990, now seen corresponding path program 1 times [2019-10-13 21:57:33,087 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:33,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76869396] [2019-10-13 21:57:33,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:33,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:33,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:33,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76869396] [2019-10-13 21:57:33,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:57:33,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 21:57:33,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743844524] [2019-10-13 21:57:33,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 21:57:33,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:33,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 21:57:33,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:57:33,440 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand 13 states. [2019-10-13 21:57:34,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:34,501 INFO L93 Difference]: Finished difference Result 217 states and 259 transitions. [2019-10-13 21:57:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:57:34,503 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-10-13 21:57:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:34,508 INFO L225 Difference]: With dead ends: 217 [2019-10-13 21:57:34,508 INFO L226 Difference]: Without dead ends: 211 [2019-10-13 21:57:34,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:57:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-13 21:57:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 185. [2019-10-13 21:57:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-13 21:57:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 223 transitions. [2019-10-13 21:57:34,536 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 223 transitions. Word has length 31 [2019-10-13 21:57:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:34,536 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 223 transitions. [2019-10-13 21:57:34,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 21:57:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 223 transitions. [2019-10-13 21:57:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 21:57:34,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:34,538 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:34,538 INFO L410 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash 340483944, now seen corresponding path program 1 times [2019-10-13 21:57:34,538 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:34,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825528031] [2019-10-13 21:57:34,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:34,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:34,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:35,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825528031] [2019-10-13 21:57:35,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:57:35,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-13 21:57:35,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278385663] [2019-10-13 21:57:35,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:57:35,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:35,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:57:35,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:57:35,294 INFO L87 Difference]: Start difference. First operand 185 states and 223 transitions. Second operand 17 states. [2019-10-13 21:57:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:38,179 INFO L93 Difference]: Finished difference Result 307 states and 377 transitions. [2019-10-13 21:57:38,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:57:38,179 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-10-13 21:57:38,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:38,187 INFO L225 Difference]: With dead ends: 307 [2019-10-13 21:57:38,187 INFO L226 Difference]: Without dead ends: 304 [2019-10-13 21:57:38,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:57:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-13 21:57:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 272. [2019-10-13 21:57:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-10-13 21:57:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 335 transitions. [2019-10-13 21:57:38,262 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 335 transitions. Word has length 34 [2019-10-13 21:57:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:38,262 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 335 transitions. [2019-10-13 21:57:38,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:57:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 335 transitions. [2019-10-13 21:57:38,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 21:57:38,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:38,302 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:38,303 INFO L410 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:38,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:38,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1593934570, now seen corresponding path program 1 times [2019-10-13 21:57:38,303 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:38,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947779974] [2019-10-13 21:57:38,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:38,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:38,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:38,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947779974] [2019-10-13 21:57:38,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:57:38,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-13 21:57:38,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602475067] [2019-10-13 21:57:38,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 21:57:38,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:38,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 21:57:38,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:57:38,733 INFO L87 Difference]: Start difference. First operand 272 states and 335 transitions. Second operand 15 states. [2019-10-13 21:57:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:41,145 INFO L93 Difference]: Finished difference Result 306 states and 375 transitions. [2019-10-13 21:57:41,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 21:57:41,145 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-10-13 21:57:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:41,148 INFO L225 Difference]: With dead ends: 306 [2019-10-13 21:57:41,148 INFO L226 Difference]: Without dead ends: 303 [2019-10-13 21:57:41,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:57:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-10-13 21:57:41,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 272. [2019-10-13 21:57:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-10-13 21:57:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 334 transitions. [2019-10-13 21:57:41,189 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 334 transitions. Word has length 37 [2019-10-13 21:57:41,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:41,191 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 334 transitions. [2019-10-13 21:57:41,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 21:57:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 334 transitions. [2019-10-13 21:57:41,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 21:57:41,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:41,194 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:41,194 INFO L410 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:41,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:41,194 INFO L82 PathProgramCache]: Analyzing trace with hash 30681139, now seen corresponding path program 1 times [2019-10-13 21:57:41,195 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:41,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967025628] [2019-10-13 21:57:41,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:41,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:41,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:41,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967025628] [2019-10-13 21:57:41,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:57:41,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-13 21:57:41,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286453439] [2019-10-13 21:57:41,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-13 21:57:41,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:41,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-13 21:57:41,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:57:41,673 INFO L87 Difference]: Start difference. First operand 272 states and 334 transitions. Second operand 16 states. [2019-10-13 21:57:43,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:43,999 INFO L93 Difference]: Finished difference Result 301 states and 367 transitions. [2019-10-13 21:57:44,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:57:44,001 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-10-13 21:57:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:44,004 INFO L225 Difference]: With dead ends: 301 [2019-10-13 21:57:44,004 INFO L226 Difference]: Without dead ends: 298 [2019-10-13 21:57:44,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2019-10-13 21:57:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-13 21:57:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 272. [2019-10-13 21:57:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-10-13 21:57:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 333 transitions. [2019-10-13 21:57:44,028 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 333 transitions. Word has length 40 [2019-10-13 21:57:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:44,029 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 333 transitions. [2019-10-13 21:57:44,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-13 21:57:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 333 transitions. [2019-10-13 21:57:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 21:57:44,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:44,030 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:44,031 INFO L410 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:44,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1014815005, now seen corresponding path program 1 times [2019-10-13 21:57:44,031 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:44,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804081183] [2019-10-13 21:57:44,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:44,032 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:44,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:44,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804081183] [2019-10-13 21:57:44,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:57:44,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-13 21:57:44,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081790998] [2019-10-13 21:57:44,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-13 21:57:44,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:44,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-13 21:57:44,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:57:44,602 INFO L87 Difference]: Start difference. First operand 272 states and 333 transitions. Second operand 16 states. [2019-10-13 21:57:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:47,443 INFO L93 Difference]: Finished difference Result 304 states and 371 transitions. [2019-10-13 21:57:47,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:57:47,445 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-10-13 21:57:47,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:47,448 INFO L225 Difference]: With dead ends: 304 [2019-10-13 21:57:47,448 INFO L226 Difference]: Without dead ends: 301 [2019-10-13 21:57:47,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-10-13 21:57:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-13 21:57:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 272. [2019-10-13 21:57:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-10-13 21:57:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 332 transitions. [2019-10-13 21:57:47,478 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 332 transitions. Word has length 43 [2019-10-13 21:57:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:47,478 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 332 transitions. [2019-10-13 21:57:47,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-13 21:57:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 332 transitions. [2019-10-13 21:57:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 21:57:47,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:47,482 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:47,482 INFO L410 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:47,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:47,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1716719016, now seen corresponding path program 1 times [2019-10-13 21:57:47,482 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:47,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859747771] [2019-10-13 21:57:47,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:47,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:47,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:57:48,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859747771] [2019-10-13 21:57:48,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346254172] [2019-10-13 21:57:48,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:57:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:48,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 132 conjunts are in the unsatisfiable core [2019-10-13 21:57:48,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:57:48,894 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 7 treesize of output 3 [2019-10-13 21:57:48,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:48,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:48,910 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 7 treesize of output 3 [2019-10-13 21:57:48,910 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:48,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:48,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:57:48,918 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-10-13 21:57:49,037 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-13 21:57:49,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:49,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:49,057 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_4| vanished before elimination [2019-10-13 21:57:49,060 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-13 21:57:49,061 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:49,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:49,077 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_BEFORE_CALL_4| vanished before elimination [2019-10-13 21:57:49,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:57:49,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:53, output treesize:18 [2019-10-13 21:57:49,300 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2019-10-13 21:57:49,300 INFO L341 Elim1Store]: treesize reduction 165, result has 27.3 percent of original size [2019-10-13 21:57:49,301 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 3 case distinctions, treesize of input 77 treesize of output 69 [2019-10-13 21:57:49,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:49,365 INFO L567 ElimStorePlain]: treesize reduction 16, result has 80.7 percent of original size [2019-10-13 21:57:49,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:49,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:49,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:57:49,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:92, output treesize:84 [2019-10-13 21:57:49,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:49,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:49,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:49,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:49,687 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-13 21:57:49,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:49,735 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:57:49,882 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2019-10-13 21:57:49,882 INFO L567 ElimStorePlain]: treesize reduction 95, result has 67.6 percent of original size [2019-10-13 21:57:49,887 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:57:49,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:49,958 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:57:50,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:50,025 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:57:50,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:50,074 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-10-13 21:57:50,074 INFO L464 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2019-10-13 21:57:50,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-10-13 21:57:50,076 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:300, output treesize:201 [2019-10-13 21:57:50,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:50,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:50,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:50,463 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-13 21:57:50,464 INFO L341 Elim1Store]: treesize reduction 78, result has 82.1 percent of original size [2019-10-13 21:57:50,465 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 5 case distinctions, treesize of input 121 treesize of output 437 [2019-10-13 21:57:50,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:50,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:50,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:50,977 WARN L191 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2019-10-13 21:57:50,978 INFO L341 Elim1Store]: treesize reduction 65, result has 89.0 percent of original size [2019-10-13 21:57:50,979 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 593 [2019-10-13 21:57:50,982 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:51,411 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 96 [2019-10-13 21:57:51,412 INFO L567 ElimStorePlain]: treesize reduction 801, result has 36.5 percent of original size [2019-10-13 21:57:51,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-10-13 21:57:51,436 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:237, output treesize:461 [2019-10-13 21:57:51,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:51,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:52,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:52,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:52,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:52,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:52,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:52,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:52,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:52,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:52,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:52,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:52,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:53,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:53,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:53,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:53,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:53,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:53,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:53,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:53,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:53,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:53,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:53,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:54,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:54,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:54,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:54,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:54,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:54,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:54,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:54,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:54,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:54,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:54,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:55,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:57,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:57,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:57,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:57,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:57,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:57,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:57,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:57,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:57,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:57,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:57,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:57:57,108 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_8, v_prenex_9], 2=[|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4|, |v_old(#memory_$Pointer$.base)_BEFORE_CALL_4|], 20=[v_prenex_7], 110=[|v_#memory_$Pointer$.base_BEFORE_CALL_7|]} [2019-10-13 21:57:57,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:57,157 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 132 treesize of output 124 [2019-10-13 21:57:57,158 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:57:57,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:57,176 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 131 treesize of output 123 [2019-10-13 21:57:57,176 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:57,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:57,200 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 131 treesize of output 123 [2019-10-13 21:57:57,201 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:58,163 WARN L191 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 116 [2019-10-13 21:57:58,163 INFO L567 ElimStorePlain]: treesize reduction 1988, result has 24.7 percent of original size [2019-10-13 21:57:58,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:58,181 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 56 treesize of output 48 [2019-10-13 21:57:58,182 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:58,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:58,199 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 84 treesize of output 64 [2019-10-13 21:57:58,200 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:58,543 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-10-13 21:57:58,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:58,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:58,562 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 105 treesize of output 101 [2019-10-13 21:57:58,563 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:58,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:58,579 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 95 treesize of output 91 [2019-10-13 21:57:58,580 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:57:58,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:58,598 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 110 treesize of output 106 [2019-10-13 21:57:58,599 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:57:58,606 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:57:58,608 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:57:58,610 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:58,980 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2019-10-13 21:57:58,981 INFO L567 ElimStorePlain]: treesize reduction 101, result has 80.3 percent of original size [2019-10-13 21:57:58,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:58,992 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 80 treesize of output 72 [2019-10-13 21:57:58,993 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:59,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:59,006 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 75 treesize of output 71 [2019-10-13 21:57:59,007 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-13 21:57:59,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:59,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2019-10-13 21:57:59,019 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:59,167 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-13 21:57:59,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:59,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:59,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:59,289 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-13 21:57:59,289 INFO L341 Elim1Store]: treesize reduction 10, result has 89.7 percent of original size [2019-10-13 21:57:59,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 73 treesize of output 124 [2019-10-13 21:57:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,308 INFO L496 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:57:59,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:59,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:59,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2019-10-13 21:57:59,319 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:59,523 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-10-13 21:57:59,524 INFO L567 ElimStorePlain]: treesize reduction 97, result has 71.2 percent of original size [2019-10-13 21:57:59,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:59,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:59,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:59,678 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-10-13 21:57:59,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:59,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 79 treesize of output 203 [2019-10-13 21:57:59,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,834 INFO L496 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 21:57:59,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:59,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:59,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:59,919 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:59,920 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 124 [2019-10-13 21:57:59,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:59,929 INFO L496 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:57:59,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:59,983 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:59,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 106 [2019-10-13 21:57:59,984 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-10-13 21:58:00,035 INFO L567 ElimStorePlain]: treesize reduction 273, result has 5.2 percent of original size [2019-10-13 21:58:00,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:58:00,036 INFO L221 ElimStorePlain]: Needed 18 recursive calls to eliminate 15 variables, input treesize:2718, output treesize:15 [2019-10-13 21:58:00,182 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-13 21:58:00,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:58:00,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:58:00,193 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_8| vanished before elimination [2019-10-13 21:58:00,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:58:00,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:15 [2019-10-13 21:58:00,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:58:00,504 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-10-13 21:58:00,505 INFO L341 Elim1Store]: treesize reduction 100, result has 50.2 percent of original size [2019-10-13 21:58:00,505 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 3 case distinctions, treesize of input 77 treesize of output 108 [2019-10-13 21:58:00,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:58:00,673 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-13 21:58:00,674 INFO L567 ElimStorePlain]: treesize reduction 36, result has 81.6 percent of original size [2019-10-13 21:58:00,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:58:00,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:58:00,676 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-13 21:58:00,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:166, output treesize:160 [2019-10-13 21:58:00,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:58:00,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:58:00,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:58:00,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:58:03,270 WARN L191 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-10-13 21:58:03,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-13 21:58:03,306 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:58:03,325 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:58:03,341 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:58:03,345 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:58:03,351 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-13 21:58:03,356 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:58:05,673 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 151 DAG size of output: 88 [2019-10-13 21:58:05,674 INFO L567 ElimStorePlain]: treesize reduction 1119, result has 50.7 percent of original size [2019-10-13 21:58:05,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-10-13 21:58:05,675 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:1446, output treesize:1149 [2019-10-13 21:58:06,301 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-13 21:58:06,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:58:06,332 INFO L392 ElimStorePlain]: Different costs {18=[v_prenex_14, v_prenex_11], 28=[|v_#memory_$Pointer$.offset_79|]} [2019-10-13 21:58:06,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:58:06,745 INFO L341 Elim1Store]: treesize reduction 6, result has 93.4 percent of original size [2019-10-13 21:58:06,746 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 709 treesize of output 686 [2019-10-13 21:58:06,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.