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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/forester-heap/sll-optional-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:12:13,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:12:13,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:12:13,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:12:13,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:12:13,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:12:13,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:12:13,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:12:13,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:12:13,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:12:13,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:12:13,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:12:13,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:12:13,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:12:13,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:12:13,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:12:13,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:12:13,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:12:13,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:12:13,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:12:13,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:12:13,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:12:13,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:12:13,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:12:13,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:12:13,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:12:13,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:12:13,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:12:13,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:12:13,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:12:13,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:12:13,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:12:13,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:12:13,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:12:13,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:12:13,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:12:13,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:12:13,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:12:13,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:12:13,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:12:13,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:12:13,601 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 20:12:13,615 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:12:13,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:12:13,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:12:13,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:12:13,618 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:12:13,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:12:13,618 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:12:13,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:12:13,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:12:13,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:12:13,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:12:13,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:12:13,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:12:13,619 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:12:13,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:12:13,620 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:12:13,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:12:13,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:12:13,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:12:13,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:12:13,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:12:13,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:12:13,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:12:13,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:12:13,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:12:13,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:12:13,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:12:13,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:12:13,623 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 20:12:13,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:12:13,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:12:13,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:12:13,957 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:12:13,958 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:12:13,958 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional-1.i [2019-10-13 20:12:14,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab2132b0/c2573f851f9f4164ab3c8d5049219e93/FLAG52ffd2f86 [2019-10-13 20:12:14,589 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:12:14,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-optional-1.i [2019-10-13 20:12:14,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab2132b0/c2573f851f9f4164ab3c8d5049219e93/FLAG52ffd2f86 [2019-10-13 20:12:14,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab2132b0/c2573f851f9f4164ab3c8d5049219e93 [2019-10-13 20:12:14,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:12:14,909 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:12:14,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:14,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:12:14,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:12:14,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:14" (1/1) ... [2019-10-13 20:12:14,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7156f2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:14, skipping insertion in model container [2019-10-13 20:12:14,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:14" (1/1) ... [2019-10-13 20:12:14,926 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:12:14,976 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:12:15,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:15,581 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:12:15,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:15,704 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:12:15,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15 WrapperNode [2019-10-13 20:12:15,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:15,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:12:15,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:12:15,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:12:15,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:12:15,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:12:15,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:12:15,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:12:15,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:12:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:12:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:12:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:12:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 20:12:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 20:12:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 20:12:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 20:12:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 20:12:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 20:12:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 20:12:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 20:12:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 20:12:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 20:12:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 20:12:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 20:12:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 20:12:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 20:12:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 20:12:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 20:12:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 20:12:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 20:12:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 20:12:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 20:12:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 20:12:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 20:12:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 20:12:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 20:12:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 20:12:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 20:12:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 20:12:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 20:12:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 20:12:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 20:12:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 20:12:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 20:12:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 20:12:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 20:12:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 20:12:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 20:12:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 20:12:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 20:12:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 20:12:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 20:12:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 20:12:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 20:12:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 20:12:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 20:12:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 20:12:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 20:12:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 20:12:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 20:12:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 20:12:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 20:12:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 20:12:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 20:12:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 20:12:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 20:12:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 20:12:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 20:12:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 20:12:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 20:12:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 20:12:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 20:12:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 20:12:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 20:12:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 20:12:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:12:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 20:12:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 20:12:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 20:12:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 20:12:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 20:12:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 20:12:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 20:12:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 20:12:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 20:12:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 20:12:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 20:12:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 20:12:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 20:12:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 20:12:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 20:12:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 20:12:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 20:12:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 20:12:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 20:12:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 20:12:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 20:12:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 20:12:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 20:12:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 20:12:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 20:12:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 20:12:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 20:12:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 20:12:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 20:12:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 20:12:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 20:12:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 20:12:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 20:12:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 20:12:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 20:12:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 20:12:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 20:12:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 20:12:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 20:12:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:12:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:12:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:12:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 20:12:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 20:12:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 20:12:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 20:12:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 20:12:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 20:12:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:12:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:12:16,457 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:12:16,457 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-13 20:12:16,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:16 BoogieIcfgContainer [2019-10-13 20:12:16,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:12:16,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:12:16,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:12:16,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:12:16,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:12:14" (1/3) ... [2019-10-13 20:12:16,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475b1120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:16, skipping insertion in model container [2019-10-13 20:12:16,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (2/3) ... [2019-10-13 20:12:16,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475b1120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:16, skipping insertion in model container [2019-10-13 20:12:16,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:16" (3/3) ... [2019-10-13 20:12:16,468 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2019-10-13 20:12:16,478 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:12:16,487 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 20:12:16,499 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 20:12:16,526 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:12:16,526 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:12:16,526 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:12:16,527 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:12:16,527 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:12:16,527 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:12:16,527 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:12:16,527 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:12:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-13 20:12:16,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 20:12:16,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:16,555 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:16,557 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:16,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:16,564 INFO L82 PathProgramCache]: Analyzing trace with hash 905993573, now seen corresponding path program 1 times [2019-10-13 20:12:16,574 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:16,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297108337] [2019-10-13 20:12:16,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:16,575 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:16,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:16,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297108337] [2019-10-13 20:12:16,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:16,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 20:12:16,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037454257] [2019-10-13 20:12:16,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:16,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:16,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:16,785 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-10-13 20:12:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:16,814 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2019-10-13 20:12:16,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:16,816 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-10-13 20:12:16,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:16,829 INFO L225 Difference]: With dead ends: 57 [2019-10-13 20:12:16,830 INFO L226 Difference]: Without dead ends: 26 [2019-10-13 20:12:16,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-13 20:12:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-13 20:12:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 20:12:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-10-13 20:12:16,881 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2019-10-13 20:12:16,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:16,881 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-10-13 20:12:16,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:16,881 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-10-13 20:12:16,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 20:12:16,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:16,883 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:16,883 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:16,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:16,883 INFO L82 PathProgramCache]: Analyzing trace with hash 550815853, now seen corresponding path program 1 times [2019-10-13 20:12:16,884 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:16,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940445152] [2019-10-13 20:12:16,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:16,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:16,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:16,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940445152] [2019-10-13 20:12:16,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:16,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:12:16,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128325071] [2019-10-13 20:12:16,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:12:16,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:16,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:12:16,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:16,990 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 3 states. [2019-10-13 20:12:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:17,011 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-10-13 20:12:17,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:12:17,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 20:12:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:17,013 INFO L225 Difference]: With dead ends: 29 [2019-10-13 20:12:17,014 INFO L226 Difference]: Without dead ends: 27 [2019-10-13 20:12:17,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-13 20:12:17,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-13 20:12:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 20:12:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-13 20:12:17,025 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2019-10-13 20:12:17,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:17,026 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-13 20:12:17,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:12:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-10-13 20:12:17,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 20:12:17,029 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:17,029 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:17,049 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:17,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:17,049 INFO L82 PathProgramCache]: Analyzing trace with hash 550817775, now seen corresponding path program 1 times [2019-10-13 20:12:17,049 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:17,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198105219] [2019-10-13 20:12:17,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:17,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198105219] [2019-10-13 20:12:17,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:17,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:12:17,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890830816] [2019-10-13 20:12:17,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:12:17,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:17,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:12:17,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:12:17,200 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 6 states. [2019-10-13 20:12:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:17,422 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2019-10-13 20:12:17,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 20:12:17,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-13 20:12:17,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:17,424 INFO L225 Difference]: With dead ends: 44 [2019-10-13 20:12:17,424 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 20:12:17,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-13 20:12:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 20:12:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2019-10-13 20:12:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-13 20:12:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-10-13 20:12:17,431 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2019-10-13 20:12:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:17,432 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-10-13 20:12:17,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:12:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-10-13 20:12:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 20:12:17,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:17,433 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:17,434 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash 548970733, now seen corresponding path program 1 times [2019-10-13 20:12:17,434 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:17,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926380122] [2019-10-13 20:12:17,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:17,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926380122] [2019-10-13 20:12:17,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:17,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 20:12:17,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216951513] [2019-10-13 20:12:17,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 20:12:17,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 20:12:17,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:12:17,731 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 7 states. [2019-10-13 20:12:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:18,130 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2019-10-13 20:12:18,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 20:12:18,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-13 20:12:18,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:18,133 INFO L225 Difference]: With dead ends: 90 [2019-10-13 20:12:18,133 INFO L226 Difference]: Without dead ends: 73 [2019-10-13 20:12:18,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-10-13 20:12:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-13 20:12:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-10-13 20:12:18,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 20:12:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2019-10-13 20:12:18,144 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 20 [2019-10-13 20:12:18,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:18,144 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2019-10-13 20:12:18,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 20:12:18,145 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2019-10-13 20:12:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 20:12:18,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:18,146 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:18,147 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:18,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:18,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1969142159, now seen corresponding path program 1 times [2019-10-13 20:12:18,148 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:18,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648037661] [2019-10-13 20:12:18,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:18,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:18,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:18,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648037661] [2019-10-13 20:12:18,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:18,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:12:18,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551637546] [2019-10-13 20:12:18,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:12:18,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:18,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:12:18,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:12:18,248 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand 6 states. [2019-10-13 20:12:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:18,464 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-10-13 20:12:18,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 20:12:18,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-13 20:12:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:18,466 INFO L225 Difference]: With dead ends: 85 [2019-10-13 20:12:18,466 INFO L226 Difference]: Without dead ends: 64 [2019-10-13 20:12:18,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 20:12:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-13 20:12:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2019-10-13 20:12:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 20:12:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2019-10-13 20:12:18,475 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 20 [2019-10-13 20:12:18,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:18,476 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-10-13 20:12:18,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:12:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2019-10-13 20:12:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 20:12:18,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:18,477 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:18,478 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:18,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2020944649, now seen corresponding path program 1 times [2019-10-13 20:12:18,478 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:18,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791632580] [2019-10-13 20:12:18,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:18,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:18,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:18,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791632580] [2019-10-13 20:12:18,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:18,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:12:18,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964024939] [2019-10-13 20:12:18,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:12:18,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:18,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:12:18,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:12:18,553 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 5 states. [2019-10-13 20:12:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:18,762 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2019-10-13 20:12:18,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 20:12:18,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-13 20:12:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:18,764 INFO L225 Difference]: With dead ends: 84 [2019-10-13 20:12:18,764 INFO L226 Difference]: Without dead ends: 82 [2019-10-13 20:12:18,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:12:18,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-13 20:12:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 50. [2019-10-13 20:12:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 20:12:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2019-10-13 20:12:18,777 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 21 [2019-10-13 20:12:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:18,778 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2019-10-13 20:12:18,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:12:18,779 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2019-10-13 20:12:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 20:12:18,780 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:18,780 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:18,780 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:18,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:18,781 INFO L82 PathProgramCache]: Analyzing trace with hash 61652601, now seen corresponding path program 1 times [2019-10-13 20:12:18,782 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:18,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301632228] [2019-10-13 20:12:18,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:18,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:18,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:19,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301632228] [2019-10-13 20:12:19,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158342897] [2019-10-13 20:12:19,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:19,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-13 20:12:19,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:12:19,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 20:12:19,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:19,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:19,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:19,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 20:12:19,609 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:19,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 20:12:19,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:19,692 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.1 percent of original size [2019-10-13 20:12:19,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2019-10-13 20:12:19,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:19,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:19,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2019-10-13 20:12:19,752 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:19,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:19,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:19,772 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:65 [2019-10-13 20:12:19,949 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:19,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-10-13 20:12:19,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:20,078 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-13 20:12:20,079 INFO L567 ElimStorePlain]: treesize reduction 46, result has 75.4 percent of original size [2019-10-13 20:12:20,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:20,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:20,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:20,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 111 [2019-10-13 20:12:20,138 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:20,267 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-13 20:12:20,267 INFO L567 ElimStorePlain]: treesize reduction 96, result has 57.1 percent of original size [2019-10-13 20:12:20,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:20,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2019-10-13 20:12:20,277 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:20,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:20,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:20,317 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:133, output treesize:108 [2019-10-13 20:12:20,457 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:20,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 47 [2019-10-13 20:12:20,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:20,614 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-13 20:12:20,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:20,617 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|], 12=[|v_#memory_$Pointer$.offset_43|], 20=[|v_#memory_$Pointer$.base_43|]} [2019-10-13 20:12:20,624 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:20,725 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-13 20:12:20,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:20,730 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:20,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:20,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:20,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:20,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:20,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 76 [2019-10-13 20:12:20,844 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:20,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:20,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:20,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:21,516 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 114 [2019-10-13 20:12:21,517 INFO L341 Elim1Store]: treesize reduction 170, result has 67.1 percent of original size [2019-10-13 20:12:21,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 182 treesize of output 418 [2019-10-13 20:12:21,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:12:21,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:12:21,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:12:21,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:12:21,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:12:21,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:12:21,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:12:21,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:21,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:12:21,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:12:21,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:12:21,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:12:21,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:21,691 INFO L496 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:23,467 WARN L191 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 288 DAG size of output: 67 [2019-10-13 20:12:23,468 INFO L567 ElimStorePlain]: treesize reduction 240062, result has 0.1 percent of original size [2019-10-13 20:12:23,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:23,471 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:285, output treesize:215 [2019-10-13 20:12:23,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:23,896 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:12:23,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:23,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:23,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:23,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:24,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:24,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:24,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:24,024 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:24,030 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:24,037 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:24,044 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:24,227 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-13 20:12:24,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:24,235 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:24,242 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:24,250 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:24,266 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:24,476 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-10-13 20:12:24,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:24,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-10-13 20:12:24,481 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:765, output treesize:765 [2019-10-13 20:12:25,592 WARN L191 SmtUtils]: Spent 950.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-10-13 20:12:25,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:12:33,089 WARN L191 SmtUtils]: Spent 6.29 s on a formula simplification that was a NOOP. DAG size: 152 [2019-10-13 20:12:44,592 WARN L191 SmtUtils]: Spent 6.36 s on a formula simplification that was a NOOP. DAG size: 203 [2019-10-13 20:12:44,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms