/usr/bin/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-fb55353 [2019-11-07 02:10:35,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 02:10:35,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 02:10:35,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 02:10:35,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 02:10:35,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 02:10:35,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 02:10:35,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 02:10:35,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 02:10:35,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 02:10:35,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 02:10:35,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 02:10:35,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 02:10:35,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 02:10:35,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 02:10:35,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 02:10:35,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 02:10:35,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 02:10:35,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 02:10:35,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 02:10:35,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 02:10:35,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 02:10:35,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 02:10:35,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 02:10:35,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 02:10:35,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 02:10:35,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 02:10:35,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 02:10:35,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 02:10:35,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 02:10:35,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 02:10:35,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 02:10:35,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 02:10:35,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 02:10:35,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 02:10:35,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 02:10:35,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 02:10:35,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 02:10:35,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 02:10:35,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 02:10:35,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 02:10:35,395 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-11-07 02:10:35,409 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 02:10:35,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 02:10:35,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 02:10:35,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 02:10:35,411 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 02:10:35,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 02:10:35,412 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 02:10:35,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 02:10:35,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 02:10:35,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 02:10:35,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 02:10:35,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 02:10:35,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 02:10:35,413 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 02:10:35,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 02:10:35,414 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 02:10:35,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 02:10:35,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 02:10:35,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 02:10:35,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 02:10:35,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 02:10:35,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 02:10:35,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 02:10:35,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 02:10:35,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 02:10:35,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 02:10:35,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 02:10:35,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 02:10:35,416 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-11-07 02:10:35,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 02:10:35,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 02:10:35,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 02:10:35,720 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 02:10:35,720 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 02:10:35,721 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-11-07 02:10:35,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa786f75/475e267c98a944a982938471fd683eb0/FLAGe38ce6221 [2019-11-07 02:10:36,436 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 02:10:36,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i [2019-11-07 02:10:36,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa786f75/475e267c98a944a982938471fd683eb0/FLAGe38ce6221 [2019-11-07 02:10:36,686 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa786f75/475e267c98a944a982938471fd683eb0 [2019-11-07 02:10:36,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 02:10:36,702 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 02:10:36,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 02:10:36,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 02:10:36,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 02:10:36,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:10:36" (1/1) ... [2019-11-07 02:10:36,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f39f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:10:36, skipping insertion in model container [2019-11-07 02:10:36,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:10:36" (1/1) ... [2019-11-07 02:10:36,748 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 02:10:36,816 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 02:10:37,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 02:10:37,369 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 02:10:37,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 02:10:37,564 INFO L192 MainTranslator]: Completed translation [2019-11-07 02:10:37,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:10:37 WrapperNode [2019-11-07 02:10:37,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 02:10:37,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 02:10:37,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 02:10:37,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 02:10:37,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:10:37" (1/1) ... [2019-11-07 02:10:37,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:10:37" (1/1) ... [2019-11-07 02:10:37,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:10:37" (1/1) ... [2019-11-07 02:10:37,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:10:37" (1/1) ... [2019-11-07 02:10:37,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:10:37" (1/1) ... [2019-11-07 02:10:37,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:10:37" (1/1) ... [2019-11-07 02:10:37,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:10:37" (1/1) ... [2019-11-07 02:10:37,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 02:10:37,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 02:10:37,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 02:10:37,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 02:10:37,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:10:37" (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-11-07 02:10:37,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 02:10:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 02:10:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-07 02:10:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-07 02:10:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-11-07 02:10:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2019-11-07 02:10:37,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2019-11-07 02:10:37,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2019-11-07 02:10:37,768 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2019-11-07 02:10:37,768 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2019-11-07 02:10:37,768 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2019-11-07 02:10:37,769 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2019-11-07 02:10:37,769 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2019-11-07 02:10:37,769 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2019-11-07 02:10:37,769 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2019-11-07 02:10:37,770 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2019-11-07 02:10:37,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 02:10:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 02:10:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-07 02:10:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-07 02:10:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-07 02:10:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-07 02:10:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-07 02:10:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-07 02:10:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-07 02:10:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-07 02:10:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-07 02:10:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-07 02:10:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-07 02:10:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-07 02:10:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-07 02:10:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-07 02:10:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-07 02:10:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-07 02:10:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-07 02:10:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-07 02:10:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-07 02:10:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-07 02:10:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-07 02:10:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-07 02:10:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-07 02:10:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-07 02:10:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-07 02:10:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-07 02:10:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-07 02:10:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-07 02:10:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-07 02:10:37,777 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-07 02:10:37,777 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-07 02:10:37,777 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-07 02:10:37,777 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-07 02:10:37,777 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-07 02:10:37,777 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-07 02:10:37,778 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-07 02:10:37,778 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-07 02:10:37,778 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-07 02:10:37,778 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-07 02:10:37,778 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-07 02:10:37,778 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-07 02:10:37,779 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-07 02:10:37,779 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-07 02:10:37,779 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-07 02:10:37,779 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-07 02:10:37,779 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-07 02:10:37,779 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-07 02:10:37,780 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-07 02:10:37,780 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-07 02:10:37,780 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-07 02:10:37,780 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-07 02:10:37,780 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-07 02:10:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-07 02:10:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-07 02:10:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-07 02:10:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-07 02:10:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-07 02:10:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-07 02:10:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-07 02:10:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-07 02:10:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-07 02:10:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-07 02:10:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-07 02:10:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-07 02:10:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-07 02:10:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-07 02:10:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-07 02:10:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-07 02:10:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-07 02:10:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-07 02:10:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-07 02:10:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-07 02:10:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-07 02:10:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-07 02:10:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-07 02:10:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-07 02:10:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-07 02:10:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-07 02:10:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-07 02:10:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-07 02:10:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-07 02:10:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-07 02:10:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-07 02:10:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-07 02:10:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-07 02:10:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-07 02:10:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-07 02:10:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-07 02:10:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-07 02:10:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-07 02:10:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-07 02:10:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-07 02:10:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-07 02:10:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-07 02:10:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-07 02:10:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-07 02:10:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-07 02:10:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-07 02:10:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-07 02:10:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-07 02:10:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-07 02:10:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-07 02:10:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2019-11-07 02:10:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2019-11-07 02:10:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2019-11-07 02:10:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2019-11-07 02:10:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2019-11-07 02:10:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2019-11-07 02:10:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2019-11-07 02:10:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2019-11-07 02:10:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2019-11-07 02:10:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2019-11-07 02:10:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2019-11-07 02:10:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2019-11-07 02:10:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2019-11-07 02:10:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2019-11-07 02:10:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2019-11-07 02:10:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2019-11-07 02:10:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2019-11-07 02:10:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2019-11-07 02:10:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2019-11-07 02:10:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2019-11-07 02:10:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2019-11-07 02:10:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2019-11-07 02:10:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2019-11-07 02:10:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2019-11-07 02:10:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2019-11-07 02:10:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2019-11-07 02:10:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2019-11-07 02:10:37,795 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2019-11-07 02:10:37,795 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2019-11-07 02:10:37,795 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2019-11-07 02:10:37,795 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2019-11-07 02:10:37,795 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2019-11-07 02:10:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2019-11-07 02:10:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2019-11-07 02:10:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2019-11-07 02:10:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2019-11-07 02:10:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2019-11-07 02:10:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2019-11-07 02:10:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-11-07 02:10:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-11-07 02:10:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2019-11-07 02:10:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2019-11-07 02:10:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2019-11-07 02:10:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-11-07 02:10:37,798 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2019-11-07 02:10:37,798 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2019-11-07 02:10:37,798 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2019-11-07 02:10:37,798 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2019-11-07 02:10:37,798 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2019-11-07 02:10:37,798 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2019-11-07 02:10:37,798 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2019-11-07 02:10:37,799 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2019-11-07 02:10:37,799 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2019-11-07 02:10:37,799 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2019-11-07 02:10:37,799 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2019-11-07 02:10:37,799 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2019-11-07 02:10:37,799 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2019-11-07 02:10:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2019-11-07 02:10:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2019-11-07 02:10:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2019-11-07 02:10:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2019-11-07 02:10:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2019-11-07 02:10:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2019-11-07 02:10:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2019-11-07 02:10:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2019-11-07 02:10:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2019-11-07 02:10:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2019-11-07 02:10:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2019-11-07 02:10:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2019-11-07 02:10:37,802 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2019-11-07 02:10:37,802 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2019-11-07 02:10:37,802 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2019-11-07 02:10:37,802 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2019-11-07 02:10:37,802 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-07 02:10:37,802 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2019-11-07 02:10:37,802 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2019-11-07 02:10:37,803 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2019-11-07 02:10:37,803 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2019-11-07 02:10:37,803 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2019-11-07 02:10:37,803 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2019-11-07 02:10:37,803 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2019-11-07 02:10:37,803 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2019-11-07 02:10:37,803 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2019-11-07 02:10:37,803 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2019-11-07 02:10:37,804 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2019-11-07 02:10:37,804 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2019-11-07 02:10:37,804 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2019-11-07 02:10:37,804 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2019-11-07 02:10:37,804 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2019-11-07 02:10:37,804 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2019-11-07 02:10:37,804 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2019-11-07 02:10:37,805 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2019-11-07 02:10:37,805 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2019-11-07 02:10:37,805 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2019-11-07 02:10:37,805 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2019-11-07 02:10:37,805 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2019-11-07 02:10:37,805 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2019-11-07 02:10:37,805 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2019-11-07 02:10:37,806 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2019-11-07 02:10:37,806 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2019-11-07 02:10:37,806 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2019-11-07 02:10:37,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 02:10:37,806 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-11-07 02:10:37,806 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2019-11-07 02:10:37,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-07 02:10:37,807 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2019-11-07 02:10:37,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-07 02:10:37,807 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2019-11-07 02:10:37,807 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2019-11-07 02:10:37,807 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2019-11-07 02:10:37,807 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2019-11-07 02:10:37,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-07 02:10:37,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 02:10:37,808 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2019-11-07 02:10:37,808 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2019-11-07 02:10:37,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 02:10:37,808 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2019-11-07 02:10:37,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 02:10:37,808 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2019-11-07 02:10:37,808 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2019-11-07 02:10:37,809 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 02:10:37,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 02:10:37,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-07 02:10:37,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-07 02:10:37,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 02:10:38,823 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 02:10:38,823 INFO L284 CfgBuilder]: Removed 41 assume(true) statements. [2019-11-07 02:10:38,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:10:38 BoogieIcfgContainer [2019-11-07 02:10:38,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 02:10:38,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 02:10:38,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 02:10:38,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 02:10:38,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:10:36" (1/3) ... [2019-11-07 02:10:38,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7227b1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:10:38, skipping insertion in model container [2019-11-07 02:10:38,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:10:37" (2/3) ... [2019-11-07 02:10:38,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7227b1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:10:38, skipping insertion in model container [2019-11-07 02:10:38,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:10:38" (3/3) ... [2019-11-07 02:10:38,833 INFO L109 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2019-11-07 02:10:38,844 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 02:10:38,853 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 02:10:38,865 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 02:10:38,893 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 02:10:38,894 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 02:10:38,894 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 02:10:38,894 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 02:10:38,894 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 02:10:38,894 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 02:10:38,894 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 02:10:38,895 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 02:10:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2019-11-07 02:10:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 02:10:38,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:10:38,924 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:10:38,926 INFO L410 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:10:38,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:10:38,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2063377772, now seen corresponding path program 1 times [2019-11-07 02:10:38,943 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:10:38,944 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133266467] [2019-11-07 02:10:38,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:10:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:10:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:10:39,114 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133266467] [2019-11-07 02:10:39,115 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:10:39,115 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 02:10:39,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126572966] [2019-11-07 02:10:39,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 02:10:39,121 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:10:39,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 02:10:39,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 02:10:39,134 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 2 states. [2019-11-07 02:10:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:10:39,194 INFO L93 Difference]: Finished difference Result 258 states and 425 transitions. [2019-11-07 02:10:39,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 02:10:39,196 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-11-07 02:10:39,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:10:39,207 INFO L225 Difference]: With dead ends: 258 [2019-11-07 02:10:39,207 INFO L226 Difference]: Without dead ends: 120 [2019-11-07 02:10:39,213 INFO L630 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-11-07 02:10:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-07 02:10:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-07 02:10:39,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-07 02:10:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2019-11-07 02:10:39,271 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 13 [2019-11-07 02:10:39,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:10:39,272 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2019-11-07 02:10:39,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 02:10:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2019-11-07 02:10:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 02:10:39,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:10:39,275 INFO L410 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-11-07 02:10:39,275 INFO L410 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:10:39,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:10:39,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1695892571, now seen corresponding path program 1 times [2019-11-07 02:10:39,276 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:10:39,276 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992960526] [2019-11-07 02:10:39,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:10:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:10:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:10:39,518 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992960526] [2019-11-07 02:10:39,518 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:10:39,519 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 02:10:39,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836208315] [2019-11-07 02:10:39,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 02:10:39,523 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:10:39,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 02:10:39,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 02:10:39,524 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand 5 states. [2019-11-07 02:10:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:10:39,824 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-11-07 02:10:39,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 02:10:39,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-07 02:10:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:10:39,827 INFO L225 Difference]: With dead ends: 122 [2019-11-07 02:10:39,828 INFO L226 Difference]: Without dead ends: 119 [2019-11-07 02:10:39,829 INFO L630 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-11-07 02:10:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-07 02:10:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-11-07 02:10:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-07 02:10:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2019-11-07 02:10:39,856 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 28 [2019-11-07 02:10:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:10:39,859 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2019-11-07 02:10:39,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 02:10:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2019-11-07 02:10:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 02:10:39,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:10:39,861 INFO L410 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-11-07 02:10:39,861 INFO L410 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:10:39,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:10:39,861 INFO L82 PathProgramCache]: Analyzing trace with hash 368229990, now seen corresponding path program 1 times [2019-11-07 02:10:39,862 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:10:39,862 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496190990] [2019-11-07 02:10:39,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:10:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:10:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:10:40,269 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496190990] [2019-11-07 02:10:40,270 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:10:40,270 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 02:10:40,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403297439] [2019-11-07 02:10:40,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 02:10:40,271 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:10:40,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 02:10:40,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-07 02:10:40,272 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand 13 states. [2019-11-07 02:10:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:10:41,510 INFO L93 Difference]: Finished difference Result 217 states and 259 transitions. [2019-11-07 02:10:41,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 02:10:41,511 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-11-07 02:10:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:10:41,517 INFO L225 Difference]: With dead ends: 217 [2019-11-07 02:10:41,517 INFO L226 Difference]: Without dead ends: 211 [2019-11-07 02:10:41,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-11-07 02:10:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-07 02:10:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 185. [2019-11-07 02:10:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-07 02:10:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 223 transitions. [2019-11-07 02:10:41,548 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 223 transitions. Word has length 31 [2019-11-07 02:10:41,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:10:41,549 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 223 transitions. [2019-11-07 02:10:41,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 02:10:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 223 transitions. [2019-11-07 02:10:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-07 02:10:41,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:10:41,551 INFO L410 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-11-07 02:10:41,551 INFO L410 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:10:41,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:10:41,551 INFO L82 PathProgramCache]: Analyzing trace with hash 340483944, now seen corresponding path program 1 times [2019-11-07 02:10:41,552 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:10:41,552 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801712368] [2019-11-07 02:10:41,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:10:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:10:42,127 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-11-07 02:10:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:10:42,392 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801712368] [2019-11-07 02:10:42,393 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:10:42,393 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-11-07 02:10:42,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102697726] [2019-11-07 02:10:42,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-07 02:10:42,394 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:10:42,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-07 02:10:42,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-11-07 02:10:42,395 INFO L87 Difference]: Start difference. First operand 185 states and 223 transitions. Second operand 17 states. [2019-11-07 02:10:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:10:45,823 INFO L93 Difference]: Finished difference Result 307 states and 377 transitions. [2019-11-07 02:10:45,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-07 02:10:45,823 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-11-07 02:10:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:10:45,832 INFO L225 Difference]: With dead ends: 307 [2019-11-07 02:10:45,833 INFO L226 Difference]: Without dead ends: 304 [2019-11-07 02:10:45,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2019-11-07 02:10:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-07 02:10:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 272. [2019-11-07 02:10:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-07 02:10:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 335 transitions. [2019-11-07 02:10:45,889 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 335 transitions. Word has length 34 [2019-11-07 02:10:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:10:45,889 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 335 transitions. [2019-11-07 02:10:45,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-07 02:10:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 335 transitions. [2019-11-07 02:10:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-07 02:10:45,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:10:45,891 INFO L410 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-11-07 02:10:45,891 INFO L410 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:10:45,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:10:45,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1593934570, now seen corresponding path program 1 times [2019-11-07 02:10:45,892 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:10:45,892 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108909164] [2019-11-07 02:10:45,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:10:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:10:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:10:46,374 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108909164] [2019-11-07 02:10:46,375 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:10:46,375 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-07 02:10:46,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203639967] [2019-11-07 02:10:46,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-07 02:10:46,376 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:10:46,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-07 02:10:46,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-11-07 02:10:46,377 INFO L87 Difference]: Start difference. First operand 272 states and 335 transitions. Second operand 15 states. [2019-11-07 02:10:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:10:48,942 INFO L93 Difference]: Finished difference Result 306 states and 375 transitions. [2019-11-07 02:10:48,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-07 02:10:48,943 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-11-07 02:10:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:10:48,946 INFO L225 Difference]: With dead ends: 306 [2019-11-07 02:10:48,946 INFO L226 Difference]: Without dead ends: 303 [2019-11-07 02:10:48,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2019-11-07 02:10:48,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-07 02:10:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 272. [2019-11-07 02:10:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-07 02:10:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 334 transitions. [2019-11-07 02:10:48,975 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 334 transitions. Word has length 37 [2019-11-07 02:10:48,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:10:48,975 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 334 transitions. [2019-11-07 02:10:48,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-07 02:10:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 334 transitions. [2019-11-07 02:10:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-07 02:10:48,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:10:48,977 INFO L410 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-11-07 02:10:48,977 INFO L410 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:10:48,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:10:48,978 INFO L82 PathProgramCache]: Analyzing trace with hash 30681139, now seen corresponding path program 1 times [2019-11-07 02:10:48,978 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:10:48,978 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384871036] [2019-11-07 02:10:48,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:10:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:10:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:10:49,535 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384871036] [2019-11-07 02:10:49,535 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:10:49,535 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-07 02:10:49,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560853335] [2019-11-07 02:10:49,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-07 02:10:49,536 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:10:49,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-07 02:10:49,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-11-07 02:10:49,537 INFO L87 Difference]: Start difference. First operand 272 states and 334 transitions. Second operand 16 states. [2019-11-07 02:10:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:10:52,178 INFO L93 Difference]: Finished difference Result 301 states and 367 transitions. [2019-11-07 02:10:52,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 02:10:52,179 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-11-07 02:10:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:10:52,182 INFO L225 Difference]: With dead ends: 301 [2019-11-07 02:10:52,182 INFO L226 Difference]: Without dead ends: 298 [2019-11-07 02:10:52,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2019-11-07 02:10:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-07 02:10:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 272. [2019-11-07 02:10:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-07 02:10:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 333 transitions. [2019-11-07 02:10:52,207 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 333 transitions. Word has length 40 [2019-11-07 02:10:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:10:52,208 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 333 transitions. [2019-11-07 02:10:52,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-07 02:10:52,208 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 333 transitions. [2019-11-07 02:10:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 02:10:52,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:10:52,209 INFO L410 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-11-07 02:10:52,210 INFO L410 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:10:52,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:10:52,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1014815005, now seen corresponding path program 1 times [2019-11-07 02:10:52,210 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:10:52,211 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535634891] [2019-11-07 02:10:52,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:10:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:10:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:10:52,876 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535634891] [2019-11-07 02:10:52,876 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:10:52,877 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-07 02:10:52,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308655744] [2019-11-07 02:10:52,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-07 02:10:52,878 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:10:52,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-07 02:10:52,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-11-07 02:10:52,878 INFO L87 Difference]: Start difference. First operand 272 states and 333 transitions. Second operand 16 states. [2019-11-07 02:10:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:10:56,180 INFO L93 Difference]: Finished difference Result 304 states and 371 transitions. [2019-11-07 02:10:56,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-07 02:10:56,186 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-11-07 02:10:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:10:56,189 INFO L225 Difference]: With dead ends: 304 [2019-11-07 02:10:56,189 INFO L226 Difference]: Without dead ends: 301 [2019-11-07 02:10:56,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-11-07 02:10:56,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-07 02:10:56,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 272. [2019-11-07 02:10:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-07 02:10:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 332 transitions. [2019-11-07 02:10:56,217 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 332 transitions. Word has length 43 [2019-11-07 02:10:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:10:56,217 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 332 transitions. [2019-11-07 02:10:56,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-07 02:10:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 332 transitions. [2019-11-07 02:10:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 02:10:56,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:10:56,222 INFO L410 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-11-07 02:10:56,223 INFO L410 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:10:56,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:10:56,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1716719016, now seen corresponding path program 1 times [2019-11-07 02:10:56,223 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:10:56,223 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438298070] [2019-11-07 02:10:56,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:10:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:10:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 02:10:57,446 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438298070] [2019-11-07 02:10:57,446 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039633418] [2019-11-07 02:10:57,446 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-11-07 02:10:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:10:57,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 132 conjunts are in the unsatisfiable core [2019-11-07 02:10:57,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 02:10:57,761 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-11-07 02:10:57,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:10:57,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:10:57,792 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-11-07 02:10:57,794 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 02:10:57,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:10:57,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 02:10:57,805 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-11-07 02:10:57,972 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-11-07 02:10:57,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:10:57,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:10:57,996 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_4| vanished before elimination [2019-11-07 02:10:58,001 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-11-07 02:10:58,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 02:10:58,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:10:58,017 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_BEFORE_CALL_4| vanished before elimination [2019-11-07 02:10:58,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 02:10:58,018 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:53, output treesize:18 [2019-11-07 02:10:58,270 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2019-11-07 02:10:58,271 INFO L341 Elim1Store]: treesize reduction 165, result has 27.3 percent of original size [2019-11-07 02:10:58,271 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-11-07 02:10:58,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:10:58,338 INFO L567 ElimStorePlain]: treesize reduction 16, result has 80.7 percent of original size [2019-11-07 02:10:58,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:10:58,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:10:58,347 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-11-07 02:10:58,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:92, output treesize:84 [2019-11-07 02:10:58,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:10:58,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:10:58,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:10:58,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:10:58,696 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-07 02:10:58,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:10:58,752 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:10:58,922 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2019-11-07 02:10:58,923 INFO L567 ElimStorePlain]: treesize reduction 95, result has 67.6 percent of original size [2019-11-07 02:10:58,930 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:10:59,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:10:59,016 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:10:59,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:10:59,093 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:10:59,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:10:59,150 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-11-07 02:10:59,150 INFO L464 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2019-11-07 02:10:59,152 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-11-07 02:10:59,152 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:300, output treesize:201 [2019-11-07 02:10:59,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:10:59,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:10:59,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:10:59,598 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-07 02:10:59,599 INFO L341 Elim1Store]: treesize reduction 78, result has 82.1 percent of original size [2019-11-07 02:10:59,599 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-11-07 02:10:59,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:10:59,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:10:59,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:00,179 WARN L191 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2019-11-07 02:11:00,179 INFO L341 Elim1Store]: treesize reduction 65, result has 89.0 percent of original size [2019-11-07 02:11:00,180 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-11-07 02:11:00,185 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 02:11:00,645 WARN L191 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 96 [2019-11-07 02:11:00,646 INFO L567 ElimStorePlain]: treesize reduction 801, result has 36.5 percent of original size [2019-11-07 02:11:00,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,673 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-11-07 02:11:00,674 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:237, output treesize:461 [2019-11-07 02:11:00,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:00,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:01,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:01,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:01,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:01,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:01,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:01,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:01,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:01,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:01,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:01,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:01,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:02,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:02,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:02,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:02,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:02,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:02,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:02,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:02,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:02,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:02,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:02,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:03,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:03,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:03,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:03,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:03,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:03,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:03,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:03,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:03,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:03,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:03,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:04,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:04,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:04,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:04,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:04,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:04,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:04,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:04,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:04,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:04,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:04,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:05,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:05,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:05,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:05,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:05,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:07,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:07,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:07,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:07,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:07,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:07,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:07,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:07,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:07,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:07,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:07,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:07,047 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-11-07 02:11:07,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:07,066 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-11-07 02:11:07,066 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:11:07,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:07,081 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-11-07 02:11:07,082 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 02:11:07,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:07,095 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-11-07 02:11:07,096 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-07 02:11:07,827 WARN L191 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 116 [2019-11-07 02:11:07,828 INFO L567 ElimStorePlain]: treesize reduction 1988, result has 24.7 percent of original size [2019-11-07 02:11:07,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:07,848 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-11-07 02:11:07,848 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-07 02:11:07,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:07,872 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-11-07 02:11:07,873 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-07 02:11:08,121 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-07 02:11:08,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:11:08,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:08,133 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-11-07 02:11:08,134 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-07 02:11:08,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:08,146 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-11-07 02:11:08,146 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:11:08,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:08,161 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-11-07 02:11:08,162 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:11:08,166 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-07 02:11:08,166 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-07 02:11:08,167 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-07 02:11:08,534 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2019-11-07 02:11:08,534 INFO L567 ElimStorePlain]: treesize reduction 101, result has 80.3 percent of original size [2019-11-07 02:11:08,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:08,548 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-11-07 02:11:08,548 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-07 02:11:08,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:08,558 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-11-07 02:11:08,559 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:11:08,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:08,572 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-11-07 02:11:08,573 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-07 02:11:08,731 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-07 02:11:08,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:11:08,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:08,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:08,889 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-07 02:11:08,889 INFO L341 Elim1Store]: treesize reduction 10, result has 89.7 percent of original size [2019-11-07 02:11:08,890 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-11-07 02:11:08,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:08,910 INFO L496 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:11:08,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:08,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:08,932 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-11-07 02:11:08,932 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-07 02:11:09,148 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-11-07 02:11:09,148 INFO L567 ElimStorePlain]: treesize reduction 97, result has 71.2 percent of original size [2019-11-07 02:11:09,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:09,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:09,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:09,307 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-07 02:11:09,307 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:11:09,308 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-11-07 02:11:09,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,435 INFO L496 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-07 02:11:09,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:09,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:09,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:09,551 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:11:09,551 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-11-07 02:11:09,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:09,563 INFO L496 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:11:09,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:09,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:11:09,619 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-11-07 02:11:09,620 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-07 02:11:09,667 INFO L567 ElimStorePlain]: treesize reduction 273, result has 5.2 percent of original size [2019-11-07 02:11:09,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 02:11:09,668 INFO L221 ElimStorePlain]: Needed 18 recursive calls to eliminate 15 variables, input treesize:2718, output treesize:15 [2019-11-07 02:11:09,802 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-11-07 02:11:09,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:11:09,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:11:09,813 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_8| vanished before elimination [2019-11-07 02:11:09,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 02:11:09,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:15 [2019-11-07 02:11:09,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:11:10,167 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-11-07 02:11:10,168 INFO L341 Elim1Store]: treesize reduction 100, result has 50.2 percent of original size [2019-11-07 02:11:10,169 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-11-07 02:11:10,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:11:10,369 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-11-07 02:11:10,370 INFO L567 ElimStorePlain]: treesize reduction 36, result has 81.6 percent of original size [2019-11-07 02:11:10,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:10,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:10,372 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-11-07 02:11:10,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:166, output treesize:160 [2019-11-07 02:11:10,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:10,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:10,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:11:10,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:11:13,442 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-11-07 02:11:13,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-07 02:11:13,470 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:11:13,496 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:11:13,519 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:11:13,529 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:11:13,536 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:11:13,545 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:11:16,340 WARN L191 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 151 DAG size of output: 88 [2019-11-07 02:11:16,341 INFO L567 ElimStorePlain]: treesize reduction 1119, result has 50.7 percent of original size [2019-11-07 02:11:16,342 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-11-07 02:11:16,342 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:1446, output treesize:1149