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-13a467a-m [2019-10-15 00:11:09,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:11:09,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:11:09,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:11:09,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:11:09,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:11:09,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:11:09,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:11:09,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:11:09,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:11:09,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:11:09,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:11:09,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:11:09,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:11:09,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:11:09,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:11:09,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:11:09,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:11:09,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:11:09,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:11:09,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:11:09,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:11:09,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:11:09,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:11:09,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:11:09,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:11:09,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:11:09,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:11:09,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:11:09,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:11:09,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:11:09,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:11:09,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:11:09,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:11:09,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:11:09,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:11:09,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:11:09,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:11:09,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:11:09,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:11:09,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:11:09,985 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-15 00:11:10,006 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:11:10,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:11:10,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:11:10,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:11:10,009 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:11:10,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:11:10,009 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:11:10,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:11:10,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:11:10,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:11:10,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:11:10,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:11:10,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:11:10,012 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:11:10,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:11:10,012 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:11:10,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:11:10,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:11:10,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:11:10,013 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:11:10,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:11:10,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:11:10,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:11:10,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:11:10,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:11:10,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:11:10,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:11:10,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:11:10,015 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-15 00:11:10,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:11:10,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:11:10,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:11:10,318 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:11:10,319 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:11:10,320 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-15 00:11:10,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9abc7d552/93c2a19248c644d6a255539e7fd26c91/FLAG512512e8b [2019-10-15 00:11:10,926 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:11:10,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-optional-1.i [2019-10-15 00:11:10,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9abc7d552/93c2a19248c644d6a255539e7fd26c91/FLAG512512e8b [2019-10-15 00:11:11,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9abc7d552/93c2a19248c644d6a255539e7fd26c91 [2019-10-15 00:11:11,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:11:11,202 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:11:11,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:11:11,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:11:11,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:11:11,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:11" (1/1) ... [2019-10-15 00:11:11,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63fcd581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:11, skipping insertion in model container [2019-10-15 00:11:11,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:11" (1/1) ... [2019-10-15 00:11:11,217 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:11:11,270 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:11:11,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:11:11,734 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:11:11,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:11:11,859 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:11:11,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:11 WrapperNode [2019-10-15 00:11:11,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:11:11,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:11:11,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:11:11,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:11:11,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:11" (1/1) ... [2019-10-15 00:11:11,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:11" (1/1) ... [2019-10-15 00:11:11,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:11" (1/1) ... [2019-10-15 00:11:11,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:11" (1/1) ... [2019-10-15 00:11:11,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:11" (1/1) ... [2019-10-15 00:11:11,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:11" (1/1) ... [2019-10-15 00:11:11,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:11" (1/1) ... [2019-10-15 00:11:11,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:11:11,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:11:11,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:11:11,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:11:11,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:11" (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-15 00:11:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:11:12,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:11:12,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:11:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 00:11:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 00:11:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 00:11:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 00:11:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 00:11:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 00:11:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 00:11:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 00:11:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 00:11:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 00:11:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 00:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 00:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 00:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 00:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 00:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 00:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 00:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 00:11:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 00:11:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 00:11:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 00:11:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 00:11:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 00:11:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 00:11:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 00:11:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 00:11:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 00:11:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 00:11:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 00:11:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 00:11:12,007 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 00:11:12,007 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 00:11:12,007 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 00:11:12,007 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 00:11:12,007 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 00:11:12,007 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 00:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 00:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 00:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 00:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 00:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 00:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 00:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 00:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 00:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 00:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 00:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 00:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 00:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 00:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 00:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 00:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 00:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 00:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 00:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 00:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 00:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 00:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 00:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-15 00:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 00:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 00:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-15 00:11:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 00:11:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:11:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-15 00:11:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 00:11:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 00:11:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 00:11:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 00:11:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 00:11:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 00:11:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 00:11:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 00:11:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 00:11:12,013 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 00:11:12,013 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 00:11:12,013 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 00:11:12,013 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 00:11:12,013 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 00:11:12,013 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 00:11:12,014 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 00:11:12,014 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 00:11:12,014 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 00:11:12,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 00:11:12,014 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 00:11:12,014 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 00:11:12,015 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 00:11:12,015 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 00:11:12,015 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 00:11:12,015 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 00:11:12,015 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 00:11:12,015 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 00:11:12,015 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 00:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 00:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 00:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 00:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 00:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 00:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 00:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 00:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 00:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 00:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 00:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 00:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 00:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 00:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 00:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 00:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 00:11:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:11:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:11:12,607 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:11:12,607 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-15 00:11:12,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:12 BoogieIcfgContainer [2019-10-15 00:11:12,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:11:12,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:11:12,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:11:12,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:11:12,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:11:11" (1/3) ... [2019-10-15 00:11:12,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f71da00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:11:12, skipping insertion in model container [2019-10-15 00:11:12,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:11" (2/3) ... [2019-10-15 00:11:12,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f71da00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:11:12, skipping insertion in model container [2019-10-15 00:11:12,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:12" (3/3) ... [2019-10-15 00:11:12,620 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2019-10-15 00:11:12,630 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:11:12,640 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 00:11:12,652 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 00:11:12,689 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:11:12,689 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:11:12,689 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:11:12,690 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:11:12,694 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:11:12,694 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:11:12,694 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:11:12,695 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:11:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-15 00:11:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 00:11:12,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:12,732 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-15 00:11:12,734 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:12,741 INFO L82 PathProgramCache]: Analyzing trace with hash 905993573, now seen corresponding path program 1 times [2019-10-15 00:11:12,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:12,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103265532] [2019-10-15 00:11:12,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:12,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:12,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:12,948 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-15 00:11:12,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103265532] [2019-10-15 00:11:12,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:12,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 00:11:12,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961163022] [2019-10-15 00:11:12,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 00:11:12,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:12,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 00:11:12,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:11:12,973 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-10-15 00:11:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:12,993 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2019-10-15 00:11:12,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 00:11:12,995 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-10-15 00:11:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:13,005 INFO L225 Difference]: With dead ends: 57 [2019-10-15 00:11:13,006 INFO L226 Difference]: Without dead ends: 26 [2019-10-15 00:11:13,009 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-15 00:11:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-15 00:11:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-15 00:11:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-15 00:11:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-10-15 00:11:13,050 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2019-10-15 00:11:13,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:13,050 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-10-15 00:11:13,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 00:11:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-10-15 00:11:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 00:11:13,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:13,052 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-15 00:11:13,052 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:13,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:13,053 INFO L82 PathProgramCache]: Analyzing trace with hash 550815853, now seen corresponding path program 1 times [2019-10-15 00:11:13,053 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:13,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333025068] [2019-10-15 00:11:13,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:13,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:13,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:13,170 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-15 00:11:13,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333025068] [2019-10-15 00:11:13,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:13,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:11:13,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947322959] [2019-10-15 00:11:13,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:11:13,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:13,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:11:13,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:11:13,178 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 3 states. [2019-10-15 00:11:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:13,216 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-10-15 00:11:13,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:11:13,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 00:11:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:13,219 INFO L225 Difference]: With dead ends: 29 [2019-10-15 00:11:13,219 INFO L226 Difference]: Without dead ends: 27 [2019-10-15 00:11:13,220 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-15 00:11:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-15 00:11:13,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-15 00:11:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 00:11:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-15 00:11:13,226 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2019-10-15 00:11:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:13,227 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-15 00:11:13,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:11:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-10-15 00:11:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 00:11:13,228 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:13,228 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-15 00:11:13,228 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash 550817775, now seen corresponding path program 1 times [2019-10-15 00:11:13,229 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:13,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341168999] [2019-10-15 00:11:13,229 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:13,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:13,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:13,377 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-15 00:11:13,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341168999] [2019-10-15 00:11:13,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:13,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:11:13,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057386223] [2019-10-15 00:11:13,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:11:13,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:13,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:11:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:11:13,380 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 6 states. [2019-10-15 00:11:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:13,592 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2019-10-15 00:11:13,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 00:11:13,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-15 00:11:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:13,594 INFO L225 Difference]: With dead ends: 44 [2019-10-15 00:11:13,594 INFO L226 Difference]: Without dead ends: 42 [2019-10-15 00:11:13,595 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-15 00:11:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-15 00:11:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2019-10-15 00:11:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 00:11:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-10-15 00:11:13,601 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2019-10-15 00:11:13,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:13,601 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-10-15 00:11:13,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:11:13,601 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-10-15 00:11:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 00:11:13,602 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:13,602 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-15 00:11:13,602 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:13,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:13,603 INFO L82 PathProgramCache]: Analyzing trace with hash 548970733, now seen corresponding path program 1 times [2019-10-15 00:11:13,603 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:13,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457992816] [2019-10-15 00:11:13,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:13,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:13,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:13,867 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-15 00:11:13,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457992816] [2019-10-15 00:11:13,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:13,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 00:11:13,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222119057] [2019-10-15 00:11:13,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 00:11:13,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:13,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 00:11:13,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 00:11:13,871 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 7 states. [2019-10-15 00:11:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:14,239 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2019-10-15 00:11:14,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 00:11:14,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-15 00:11:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:14,241 INFO L225 Difference]: With dead ends: 90 [2019-10-15 00:11:14,242 INFO L226 Difference]: Without dead ends: 73 [2019-10-15 00:11:14,242 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-15 00:11:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-15 00:11:14,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-10-15 00:11:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-15 00:11:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2019-10-15 00:11:14,253 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 20 [2019-10-15 00:11:14,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:14,253 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2019-10-15 00:11:14,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 00:11:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2019-10-15 00:11:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 00:11:14,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:14,254 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-15 00:11:14,255 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:14,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:14,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1969142159, now seen corresponding path program 1 times [2019-10-15 00:11:14,256 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:14,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862230158] [2019-10-15 00:11:14,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:14,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:14,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:14,330 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-15 00:11:14,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862230158] [2019-10-15 00:11:14,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:14,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:11:14,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384786091] [2019-10-15 00:11:14,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:11:14,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:14,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:11:14,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:11:14,333 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand 6 states. [2019-10-15 00:11:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:14,556 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-10-15 00:11:14,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 00:11:14,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-15 00:11:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:14,558 INFO L225 Difference]: With dead ends: 85 [2019-10-15 00:11:14,558 INFO L226 Difference]: Without dead ends: 64 [2019-10-15 00:11:14,558 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-15 00:11:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-15 00:11:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2019-10-15 00:11:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-15 00:11:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2019-10-15 00:11:14,566 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 20 [2019-10-15 00:11:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:14,566 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-10-15 00:11:14,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:11:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2019-10-15 00:11:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 00:11:14,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:14,567 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-15 00:11:14,567 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2020944649, now seen corresponding path program 1 times [2019-10-15 00:11:14,568 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:14,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359662177] [2019-10-15 00:11:14,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:14,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:14,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:14,646 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-15 00:11:14,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359662177] [2019-10-15 00:11:14,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:14,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:11:14,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076294349] [2019-10-15 00:11:14,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:11:14,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:11:14,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:11:14,649 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 5 states. [2019-10-15 00:11:14,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:14,819 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2019-10-15 00:11:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 00:11:14,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-15 00:11:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:14,822 INFO L225 Difference]: With dead ends: 84 [2019-10-15 00:11:14,823 INFO L226 Difference]: Without dead ends: 82 [2019-10-15 00:11:14,823 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-15 00:11:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-15 00:11:14,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 50. [2019-10-15 00:11:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-15 00:11:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2019-10-15 00:11:14,832 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 21 [2019-10-15 00:11:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:14,832 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2019-10-15 00:11:14,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:11:14,832 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2019-10-15 00:11:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 00:11:14,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:14,833 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-15 00:11:14,834 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:14,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:14,834 INFO L82 PathProgramCache]: Analyzing trace with hash 61652601, now seen corresponding path program 1 times [2019-10-15 00:11:14,834 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:14,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161197264] [2019-10-15 00:11:14,835 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:14,835 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:14,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:15,310 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-15 00:11:15,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161197264] [2019-10-15 00:11:15,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175163200] [2019-10-15 00:11:15,311 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-15 00:11:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:15,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-15 00:11:15,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:11:15,513 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-15 00:11:15,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:15,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:15,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:11:15,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-15 00:11:15,561 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:15,562 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-15 00:11:15,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:15,621 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.1 percent of original size [2019-10-15 00:11:15,641 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-15 00:11:15,642 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:15,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:15,667 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-15 00:11:15,668 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:15,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:15,685 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-15 00:11:15,686 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:65 [2019-10-15 00:11:15,818 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:15,818 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-15 00:11:15,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:15,947 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-15 00:11:15,948 INFO L567 ElimStorePlain]: treesize reduction 46, result has 75.4 percent of original size [2019-10-15 00:11:15,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:15,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:16,015 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:16,016 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-15 00:11:16,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:16,120 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-15 00:11:16,121 INFO L567 ElimStorePlain]: treesize reduction 96, result has 57.1 percent of original size [2019-10-15 00:11:16,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:16,131 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-15 00:11:16,132 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:16,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:16,172 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-15 00:11:16,172 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:133, output treesize:108 [2019-10-15 00:11:16,297 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:16,298 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-15 00:11:16,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:16,412 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-15 00:11:16,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:16,415 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-15 00:11:16,423 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-15 00:11:16,528 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-15 00:11:16,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:16,536 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-15 00:11:16,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:16,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:16,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:16,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:16,635 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-15 00:11:16,636 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:16,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:16,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:16,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:17,272 WARN L191 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 114 [2019-10-15 00:11:17,272 INFO L341 Elim1Store]: treesize reduction 170, result has 67.1 percent of original size [2019-10-15 00:11:17,273 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-15 00:11:17,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:17,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:17,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:17,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:17,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:17,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:17,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:17,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:17,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:17,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:17,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:17,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:17,438 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-15 00:11:19,123 WARN L191 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 288 DAG size of output: 67 [2019-10-15 00:11:19,124 INFO L567 ElimStorePlain]: treesize reduction 240062, result has 0.1 percent of original size [2019-10-15 00:11:19,126 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-15 00:11:19,127 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:285, output treesize:215 [2019-10-15 00:11:19,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:19,550 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-15 00:11:19,551 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:11:19,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:19,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:19,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:19,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:19,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:19,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:19,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:19,660 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-15 00:11:19,666 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-15 00:11:19,673 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-15 00:11:19,681 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-15 00:11:19,834 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-15 00:11:19,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:19,841 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-15 00:11:19,848 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-15 00:11:19,856 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-15 00:11:19,866 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-15 00:11:20,080 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-10-15 00:11:20,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:20,082 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-15 00:11:20,083 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:765, output treesize:765 [2019-10-15 00:11:21,133 WARN L191 SmtUtils]: Spent 918.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-10-15 00:11:21,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:28,386 WARN L191 SmtUtils]: Spent 6.20 s on a formula simplification that was a NOOP. DAG size: 152 [2019-10-15 00:11:40,673 WARN L191 SmtUtils]: Spent 6.26 s on a formula simplification that was a NOOP. DAG size: 203 [2019-10-15 00:11:40,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:11:59,798 WARN L191 SmtUtils]: Spent 8.30 s on a formula simplification that was a NOOP. DAG size: 203 [2019-10-15 00:11:59,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:12:00,044 INFO L172 IndexEqualityManager]: detected equality via solver