java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-buckets-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:41:41,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:41:41,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:41:41,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:41:41,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:41:41,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:41:41,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:41:41,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:41:41,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:41:41,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:41:41,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:41:41,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:41:41,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:41:41,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:41:41,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:41:41,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:41:41,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:41:41,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:41:41,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:41:41,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:41:41,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:41:41,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:41:41,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:41:41,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:41:41,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:41:41,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:41:41,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:41:41,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:41:41,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:41:41,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:41:41,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:41:41,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:41:41,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:41:41,827 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:41:41,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:41:41,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:41:41,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:41:41,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:41:41,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:41:41,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:41:41,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:41:41,832 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-09-08 01:41:41,846 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:41:41,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:41:41,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:41:41,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:41:41,848 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:41:41,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:41:41,848 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:41:41,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:41:41,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:41:41,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:41:41,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:41:41,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:41:41,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:41:41,850 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:41:41,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:41:41,850 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:41:41,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:41:41,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:41:41,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:41:41,851 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:41:41,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:41:41,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:41:41,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:41:41,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:41:41,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:41:41,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:41:41,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:41:41,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:41:41,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:41:41,880 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:41:41,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:41:41,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:41:41,898 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:41:41,898 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:41:41,899 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets-2.i [2019-09-08 01:41:41,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b6ae07dd/7f4d207aff7c4e4c851a46d2339b23b1/FLAG1f6488306 [2019-09-08 01:41:42,455 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:41:42,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-2.i [2019-09-08 01:41:42,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b6ae07dd/7f4d207aff7c4e4c851a46d2339b23b1/FLAG1f6488306 [2019-09-08 01:41:42,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b6ae07dd/7f4d207aff7c4e4c851a46d2339b23b1 [2019-09-08 01:41:42,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:41:42,741 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:41:42,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:41:42,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:41:42,744 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:41:42,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:41:42" (1/1) ... [2019-09-08 01:41:42,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfb511f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:42, skipping insertion in model container [2019-09-08 01:41:42,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:41:42" (1/1) ... [2019-09-08 01:41:42,755 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:41:42,813 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:41:43,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:41:43,278 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:41:43,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:41:43,386 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:41:43,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:43 WrapperNode [2019-09-08 01:41:43,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:41:43,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:41:43,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:41:43,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:41:43,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:43" (1/1) ... [2019-09-08 01:41:43,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:43" (1/1) ... [2019-09-08 01:41:43,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:43" (1/1) ... [2019-09-08 01:41:43,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:43" (1/1) ... [2019-09-08 01:41:43,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:43" (1/1) ... [2019-09-08 01:41:43,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:43" (1/1) ... [2019-09-08 01:41:43,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:43" (1/1) ... [2019-09-08 01:41:43,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:41:43,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:41:43,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:41:43,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:41:43,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:43" (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-09-08 01:41:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:41:43,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:41:43,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:41:43,512 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-08 01:41:43,512 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-08 01:41:43,512 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-08 01:41:43,513 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-08 01:41:43,513 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-08 01:41:43,513 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-08 01:41:43,513 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-08 01:41:43,513 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-08 01:41:43,513 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-08 01:41:43,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-08 01:41:43,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-08 01:41:43,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-08 01:41:43,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-08 01:41:43,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-08 01:41:43,514 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-08 01:41:43,515 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-08 01:41:43,515 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-08 01:41:43,515 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-08 01:41:43,515 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-08 01:41:43,515 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-08 01:41:43,516 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-08 01:41:43,516 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-08 01:41:43,516 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-08 01:41:43,516 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-08 01:41:43,516 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-08 01:41:43,516 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-08 01:41:43,516 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-08 01:41:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-08 01:41:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-08 01:41:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-08 01:41:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-08 01:41:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-08 01:41:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-08 01:41:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-08 01:41:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-08 01:41:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-08 01:41:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-08 01:41:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-08 01:41:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-08 01:41:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-08 01:41:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-08 01:41:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-08 01:41:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-08 01:41:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-08 01:41:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-08 01:41:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-08 01:41:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-08 01:41:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-08 01:41:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-08 01:41:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-08 01:41:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 01:41:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 01:41:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-08 01:41:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 01:41:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-08 01:41:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-08 01:41:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-08 01:41:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-08 01:41:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-08 01:41:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-08 01:41:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-08 01:41:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-08 01:41:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-08 01:41:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 01:41:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-08 01:41:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-08 01:41:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-08 01:41:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-08 01:41:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-08 01:41:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-08 01:41:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-08 01:41:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-08 01:41:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-08 01:41:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-08 01:41:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-08 01:41:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-08 01:41:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-08 01:41:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-08 01:41:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-08 01:41:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-08 01:41:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-08 01:41:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-08 01:41:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-08 01:41:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-08 01:41:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-08 01:41:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-08 01:41:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-08 01:41:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-08 01:41:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-08 01:41:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-08 01:41:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-08 01:41:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-08 01:41:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-08 01:41:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-08 01:41:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-08 01:41:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-08 01:41:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-08 01:41:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-08 01:41:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-08 01:41:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-08 01:41:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-08 01:41:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-08 01:41:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-08 01:41:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:41:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:41:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:41:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 01:41:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 01:41:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 01:41:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 01:41:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 01:41:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 01:41:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:41:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:41:44,253 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:41:44,254 INFO L283 CfgBuilder]: Removed 15 assume(true) statements. [2019-09-08 01:41:44,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:41:44 BoogieIcfgContainer [2019-09-08 01:41:44,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:41:44,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:41:44,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:41:44,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:41:44,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:41:42" (1/3) ... [2019-09-08 01:41:44,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51289e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:41:44, skipping insertion in model container [2019-09-08 01:41:44,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:41:43" (2/3) ... [2019-09-08 01:41:44,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51289e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:41:44, skipping insertion in model container [2019-09-08 01:41:44,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:41:44" (3/3) ... [2019-09-08 01:41:44,263 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2019-09-08 01:41:44,272 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:41:44,280 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-09-08 01:41:44,296 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-09-08 01:41:44,326 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:41:44,327 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:41:44,327 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:41:44,327 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:41:44,327 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:41:44,327 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:41:44,328 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:41:44,328 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:41:44,328 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:41:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-09-08 01:41:44,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 01:41:44,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:44,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:44,369 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:44,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:44,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1953697339, now seen corresponding path program 1 times [2019-09-08 01:41:44,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:44,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:44,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:44,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:44,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:44,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:44,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 01:41:44,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:41:44,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:41:44,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:41:44,644 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 4 states. [2019-09-08 01:41:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:44,763 INFO L93 Difference]: Finished difference Result 118 states and 194 transitions. [2019-09-08 01:41:44,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:41:44,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-08 01:41:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:44,777 INFO L225 Difference]: With dead ends: 118 [2019-09-08 01:41:44,778 INFO L226 Difference]: Without dead ends: 70 [2019-09-08 01:41:44,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:41:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-08 01:41:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 45. [2019-09-08 01:41:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-08 01:41:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2019-09-08 01:41:44,825 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 12 [2019-09-08 01:41:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:44,825 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2019-09-08 01:41:44,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:41:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2019-09-08 01:41:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 01:41:44,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:44,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:44,827 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:44,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:44,828 INFO L82 PathProgramCache]: Analyzing trace with hash 471340906, now seen corresponding path program 1 times [2019-09-08 01:41:44,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:44,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:44,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:44,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:44,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:44,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:44,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:41:44,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:41:44,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:41:44,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:41:44,936 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 3 states. [2019-09-08 01:41:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:44,977 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2019-09-08 01:41:44,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:41:44,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-08 01:41:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:44,979 INFO L225 Difference]: With dead ends: 49 [2019-09-08 01:41:44,979 INFO L226 Difference]: Without dead ends: 47 [2019-09-08 01:41:44,980 INFO L628 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-09-08 01:41:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-08 01:41:44,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-09-08 01:41:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 01:41:44,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-09-08 01:41:44,987 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 13 [2019-09-08 01:41:44,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:44,988 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-09-08 01:41:44,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:41:44,988 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-09-08 01:41:44,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 01:41:44,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:44,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:44,989 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:44,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:44,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1726702173, now seen corresponding path program 1 times [2019-09-08 01:41:44,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:44,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:44,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:44,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:44,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:45,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:45,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 01:41:45,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:41:45,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:41:45,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:41:45,165 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 5 states. [2019-09-08 01:41:45,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:45,371 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2019-09-08 01:41:45,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:41:45,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-08 01:41:45,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:45,374 INFO L225 Difference]: With dead ends: 65 [2019-09-08 01:41:45,374 INFO L226 Difference]: Without dead ends: 54 [2019-09-08 01:41:45,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:41:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-08 01:41:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2019-09-08 01:41:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-08 01:41:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2019-09-08 01:41:45,383 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 14 [2019-09-08 01:41:45,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:45,384 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2019-09-08 01:41:45,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:41:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2019-09-08 01:41:45,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 01:41:45,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:45,385 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:45,385 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:45,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:45,386 INFO L82 PathProgramCache]: Analyzing trace with hash 602561823, now seen corresponding path program 1 times [2019-09-08 01:41:45,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:45,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:45,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:45,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:45,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:45,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:41:45,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:41:45,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:41:45,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:41:45,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:41:45,423 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 3 states. [2019-09-08 01:41:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:45,533 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2019-09-08 01:41:45,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:41:45,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-08 01:41:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:45,534 INFO L225 Difference]: With dead ends: 49 [2019-09-08 01:41:45,534 INFO L226 Difference]: Without dead ends: 47 [2019-09-08 01:41:45,535 INFO L628 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-09-08 01:41:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-08 01:41:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-08 01:41:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-08 01:41:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-09-08 01:41:45,542 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 14 [2019-09-08 01:41:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:45,542 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-09-08 01:41:45,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:41:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-09-08 01:41:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 01:41:45,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:45,544 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:45,544 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:45,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:45,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2131101984, now seen corresponding path program 1 times [2019-09-08 01:41:45,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:45,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:45,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:45,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:45,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:45,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:41:45,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:41:45,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:41:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:45,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 01:41:45,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:41:46,261 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:46,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-09-08 01:41:46,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:46,529 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-09-08 01:41:46,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:46,541 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_39|], 1=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_38|]} [2019-09-08 01:41:46,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:46,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2019-09-08 01:41:46,677 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:46,827 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-09-08 01:41:46,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:46,834 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:46,971 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-08 01:41:46,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:46,975 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:47,098 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-08 01:41:47,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:47,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:47,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2019-09-08 01:41:47,139 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:47,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:47,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:47,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2019-09-08 01:41:47,236 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:47,309 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.7 percent of original size [2019-09-08 01:41:47,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:47,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:47,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2019-09-08 01:41:47,321 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:47,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:47,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:47,366 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:207, output treesize:150 [2019-09-08 01:41:47,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:47,495 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:41:47,607 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-08 01:41:47,608 INFO L341 Elim1Store]: treesize reduction 8, result has 91.6 percent of original size [2019-09-08 01:41:47,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 144 treesize of output 171 [2019-09-08 01:41:47,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:47,736 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-08 01:41:47,736 INFO L567 ElimStorePlain]: treesize reduction 164, result has 49.8 percent of original size [2019-09-08 01:41:47,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:47,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:47,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 87 [2019-09-08 01:41:47,746 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:47,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:47,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:47,777 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:150 [2019-09-08 01:41:47,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:47,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:47,844 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:41:47,913 INFO L341 Elim1Store]: treesize reduction 16, result has 76.5 percent of original size [2019-09-08 01:41:47,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 171 treesize of output 126 [2019-09-08 01:41:47,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:47,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:47,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:47,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:47,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:47,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:47,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:47,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:47,925 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:47,979 INFO L567 ElimStorePlain]: treesize reduction 20, result has 78.9 percent of original size [2019-09-08 01:41:47,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:47,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 43 [2019-09-08 01:41:48,000 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:48,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:48,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:48,011 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:185, output treesize:7 [2019-09-08 01:41:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:48,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:41:48,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-09-08 01:41:48,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:41:48,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:41:48,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:41:48,024 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 10 states. [2019-09-08 01:41:48,266 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-09-08 01:41:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:48,903 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-09-08 01:41:48,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:41:48,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-09-08 01:41:48,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:48,905 INFO L225 Difference]: With dead ends: 75 [2019-09-08 01:41:48,905 INFO L226 Difference]: Without dead ends: 64 [2019-09-08 01:41:48,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:41:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-08 01:41:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-09-08 01:41:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-08 01:41:48,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-09-08 01:41:48,915 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 19 [2019-09-08 01:41:48,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:48,916 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-09-08 01:41:48,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:41:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-09-08 01:41:48,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 01:41:48,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:48,917 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:48,917 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:48,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:48,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1728098773, now seen corresponding path program 1 times [2019-09-08 01:41:48,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:48,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:48,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:48,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:48,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:49,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:41:49,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:41:49,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:49,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 01:41:49,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:41:49,237 INFO L341 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2019-09-08 01:41:49,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 42 [2019-09-08 01:41:49,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:49,360 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-08 01:41:49,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:49,363 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_42|], 4=[|v_#memory_$Pointer$.base_43|], 6=[|v_#memory_$Pointer$.base_44|]} [2019-09-08 01:41:49,388 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-09-08 01:41:49,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 17 [2019-09-08 01:41:49,389 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:49,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:49,433 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:49,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:49,523 INFO L341 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2019-09-08 01:41:49,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 64 [2019-09-08 01:41:49,524 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:49,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:49,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:49,562 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:142, output treesize:126 [2019-09-08 01:41:49,623 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:49,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-09-08 01:41:49,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:49,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:50,118 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2019-09-08 01:41:50,118 INFO L341 Elim1Store]: treesize reduction 30, result has 91.2 percent of original size [2019-09-08 01:41:50,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 130 treesize of output 374 [2019-09-08 01:41:50,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:41:50,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:50,429 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:50,549 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 45 [2019-09-08 01:41:50,549 INFO L567 ElimStorePlain]: treesize reduction 334, result has 23.2 percent of original size [2019-09-08 01:41:50,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:50,552 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:142, output treesize:130 [2019-09-08 01:41:50,997 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 112 [2019-09-08 01:41:50,997 INFO L341 Elim1Store]: treesize reduction 212, result has 54.3 percent of original size [2019-09-08 01:41:50,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 24 case distinctions, treesize of input 145 treesize of output 313 [2019-09-08 01:41:51,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,039 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:51,137 INFO L567 ElimStorePlain]: treesize reduction 180, result has 35.9 percent of original size [2019-09-08 01:41:51,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:51,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:149, output treesize:130 [2019-09-08 01:41:51,610 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2019-09-08 01:41:51,611 INFO L341 Elim1Store]: treesize reduction 30, result has 88.0 percent of original size [2019-09-08 01:41:51,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 133 treesize of output 269 [2019-09-08 01:41:51,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:41:51,636 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:51,672 INFO L567 ElimStorePlain]: treesize reduction 104, result has 21.8 percent of original size [2019-09-08 01:41:51,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:51,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:4 [2019-09-08 01:41:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:51,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:41:51,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-09-08 01:41:51,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:41:51,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:41:51,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:41:51,683 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 10 states. [2019-09-08 01:41:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:52,767 INFO L93 Difference]: Finished difference Result 169 states and 208 transitions. [2019-09-08 01:41:52,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 01:41:52,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-09-08 01:41:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:52,771 INFO L225 Difference]: With dead ends: 169 [2019-09-08 01:41:52,771 INFO L226 Difference]: Without dead ends: 167 [2019-09-08 01:41:52,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-08 01:41:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-08 01:41:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 85. [2019-09-08 01:41:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-08 01:41:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2019-09-08 01:41:52,784 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 20 [2019-09-08 01:41:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:52,784 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2019-09-08 01:41:52,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:41:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2019-09-08 01:41:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 01:41:52,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:52,786 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:52,786 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1450874320, now seen corresponding path program 2 times [2019-09-08 01:41:52,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:52,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:52,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:52,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:41:52,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:41:52,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:41:52,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:41:52,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:41:53,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:41:53,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:41:53,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 01:41:53,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:41:53,199 INFO L341 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2019-09-08 01:41:53,200 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 4 case distinctions, treesize of input 35 treesize of output 42 [2019-09-08 01:41:53,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:53,322 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-09-08 01:41:53,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:53,324 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_39|], 2=[|v_#memory_int_34|, |v_#memory_int_35|, |v_#memory_int_36|], 4=[|v_#memory_int_37|, |v_#memory_int_38|]} [2019-09-08 01:41:53,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:53,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2019-09-08 01:41:53,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:53,457 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-09-08 01:41:53,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:53,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:53,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-09-08 01:41:53,472 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:53,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:53,543 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:53,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:53,596 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:53,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:53,636 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:53,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:53,737 INFO L341 Elim1Store]: treesize reduction 156, result has 19.2 percent of original size [2019-09-08 01:41:53,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 56 [2019-09-08 01:41:53,739 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:53,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:53,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:53,770 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 11 variables, input treesize:152, output treesize:58 [2019-09-08 01:41:53,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:53,820 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 21 treesize of output 37 [2019-09-08 01:41:53,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:53,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:53,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2019-09-08 01:41:53,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:53,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:53,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:53,862 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:78, output treesize:55 [2019-09-08 01:41:53,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-09-08 01:41:53,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:53,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:53,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:53,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:64 [2019-09-08 01:41:54,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2019-09-08 01:41:54,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:54,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:54,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:41:54,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:7 [2019-09-08 01:41:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:41:54,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 01:41:54,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2019-09-08 01:41:54,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 01:41:54,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 01:41:54,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:41:54,065 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand 13 states. [2019-09-08 01:41:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:41:55,625 INFO L93 Difference]: Finished difference Result 181 states and 227 transitions. [2019-09-08 01:41:55,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 01:41:55,625 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-09-08 01:41:55,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:41:55,628 INFO L225 Difference]: With dead ends: 181 [2019-09-08 01:41:55,628 INFO L226 Difference]: Without dead ends: 146 [2019-09-08 01:41:55,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2019-09-08 01:41:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-08 01:41:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 92. [2019-09-08 01:41:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-08 01:41:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2019-09-08 01:41:55,642 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 22 [2019-09-08 01:41:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:41:55,642 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2019-09-08 01:41:55,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 01:41:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2019-09-08 01:41:55,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 01:41:55,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:41:55,644 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:41:55,644 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:41:55,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:41:55,645 INFO L82 PathProgramCache]: Analyzing trace with hash -314905825, now seen corresponding path program 1 times [2019-09-08 01:41:55,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:41:55,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:41:55,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:55,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:41:55,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:41:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:41:55,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:41:55,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:41:55,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:41:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:41:55,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 01:41:55,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:41:56,826 INFO L235 Elim1Store]: Index analysis took 321 ms [2019-09-08 01:41:56,862 INFO L341 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2019-09-08 01:41:56,863 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 4 case distinctions, treesize of input 35 treesize of output 42 [2019-09-08 01:41:56,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:57,377 WARN L188 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-09-08 01:41:57,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:57,384 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_44|, |v_#memory_int_45|, |v_#memory_int_43|], 2=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_43|, |v_#memory_int_42|], 4=[|v_#memory_$Pointer$.base_48|, |v_#memory_int_44|, |v_#memory_$Pointer$.offset_42|]} [2019-09-08 01:41:57,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:57,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2019-09-08 01:41:57,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:58,322 WARN L188 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-09-08 01:41:58,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:58,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:58,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2019-09-08 01:41:58,407 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:58,670 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-09-08 01:41:58,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:58,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-09-08 01:41:58,712 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:58,908 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-09-08 01:41:58,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:58,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-09-08 01:41:58,930 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:59,084 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-08 01:41:59,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:59,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:59,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 37 [2019-09-08 01:41:59,174 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:59,290 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-08 01:41:59,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:59,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:59,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 37 [2019-09-08 01:41:59,334 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:59,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:59,423 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:59,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:59,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:59,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:59,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2019-09-08 01:41:59,505 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:59,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:59,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:59,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:59,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:59,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2019-09-08 01:41:59,582 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:59,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:59,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:59,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:41:59,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2019-09-08 01:41:59,647 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:59,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:59,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 10 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:41:59,704 INFO L221 ElimStorePlain]: Needed 12 recursive calls to eliminate 15 variables, input treesize:300, output treesize:203 [2019-09-08 01:41:59,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:59,815 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 33 treesize of output 49 [2019-09-08 01:41:59,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:59,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:59,892 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_46|], 30=[|v_#memory_$Pointer$.offset_45|], 40=[|v_#memory_$Pointer$.base_50|]} [2019-09-08 01:41:59,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2019-09-08 01:41:59,900 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:41:59,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:41:59,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:00,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:00,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 82 [2019-09-08 01:42:00,004 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:00,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:00,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:00,698 WARN L188 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2019-09-08 01:42:00,699 INFO L341 Elim1Store]: treesize reduction 10, result has 96.7 percent of original size [2019-09-08 01:42:00,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 191 treesize of output 393 [2019-09-08 01:42:00,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:00,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:00,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:00,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:00,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:00,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:00,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:00,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:00,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:00,775 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:42:01,031 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 69 [2019-09-08 01:42:01,032 INFO L567 ElimStorePlain]: treesize reduction 252, result has 39.0 percent of original size [2019-09-08 01:42:01,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:42:01,034 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:245, output treesize:214 [2019-09-08 01:42:01,147 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_47|], 42=[|v_#memory_$Pointer$.offset_46|], 54=[|v_#memory_$Pointer$.base_51|]} [2019-09-08 01:42:01,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2019-09-08 01:42:01,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:01,279 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-08 01:42:01,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:01,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:01,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:01,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:01,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2019-09-08 01:42:01,297 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:01,403 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-09-08 01:42:01,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:01,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:01,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:02,082 WARN L188 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2019-09-08 01:42:02,083 INFO L341 Elim1Store]: treesize reduction 110, result has 72.0 percent of original size [2019-09-08 01:42:02,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 22 case distinctions, treesize of input 206 treesize of output 386 [2019-09-08 01:42:02,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,132 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:42:02,301 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-09-08 01:42:02,302 INFO L567 ElimStorePlain]: treesize reduction 192, result has 47.0 percent of original size [2019-09-08 01:42:02,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:42:02,303 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:265, output treesize:223 [2019-09-08 01:42:02,490 INFO L392 ElimStorePlain]: Different costs {30=[|#memory_$Pointer$.offset|], 40=[|#memory_$Pointer$.base|]} [2019-09-08 01:42:02,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:02,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:02,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 22 [2019-09-08 01:42:02,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:02,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:02,835 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2019-09-08 01:42:02,836 INFO L341 Elim1Store]: treesize reduction 20, result has 91.3 percent of original size [2019-09-08 01:42:02,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 151 treesize of output 271 [2019-09-08 01:42:02,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:02,853 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:42:02,905 INFO L567 ElimStorePlain]: treesize reduction 102, result has 34.2 percent of original size [2019-09-08 01:42:02,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 01:42:02,906 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:237, output treesize:41 [2019-09-08 01:42:02,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 16 [2019-09-08 01:42:02,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:02,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:02,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:42:02,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:54, output treesize:7 [2019-09-08 01:42:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:42:02,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:42:02,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-08 01:42:02,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 01:42:02,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 01:42:02,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:42:02,993 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand 14 states. [2019-09-08 01:42:03,847 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-09-08 01:42:04,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:42:04,529 INFO L93 Difference]: Finished difference Result 172 states and 210 transitions. [2019-09-08 01:42:04,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:42:04,530 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-09-08 01:42:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:42:04,531 INFO L225 Difference]: With dead ends: 172 [2019-09-08 01:42:04,531 INFO L226 Difference]: Without dead ends: 137 [2019-09-08 01:42:04,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:42:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-08 01:42:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 101. [2019-09-08 01:42:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-08 01:42:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2019-09-08 01:42:04,562 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 25 [2019-09-08 01:42:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:42:04,562 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2019-09-08 01:42:04,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 01:42:04,565 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2019-09-08 01:42:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 01:42:04,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:42:04,567 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:42:04,567 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:42:04,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:42:04,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1335974179, now seen corresponding path program 1 times [2019-09-08 01:42:04,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:42:04,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:42:04,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:42:04,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:42:04,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:42:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:42:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:42:04,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:42:04,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:42:04,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:42:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:42:04,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 01:42:04,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:42:05,533 INFO L235 Elim1Store]: Index analysis took 356 ms [2019-09-08 01:42:05,562 INFO L341 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2019-09-08 01:42:05,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 4 case distinctions, treesize of input 35 treesize of output 42 [2019-09-08 01:42:05,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:06,127 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-09-08 01:42:06,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:06,130 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_49|, |v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_52|], 2=[|v_#memory_int_48|], 4=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_53|], 6=[|v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_54|]} [2019-09-08 01:42:06,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:06,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2019-09-08 01:42:06,336 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:06,791 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-08 01:42:06,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:06,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:06,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 17 [2019-09-08 01:42:06,976 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:07,384 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-08 01:42:07,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:07,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:07,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 17 [2019-09-08 01:42:07,467 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:07,586 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-08 01:42:07,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:07,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:07,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-09-08 01:42:07,597 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:07,708 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-09-08 01:42:07,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:07,712 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:42:07,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:07,800 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:42:07,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:07,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:07,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:07,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:07,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:07,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:07,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 64 [2019-09-08 01:42:07,893 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:07,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:07,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:07,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:07,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:07,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:07,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:07,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 64 [2019-09-08 01:42:07,974 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:08,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:08,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:42:08,029 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:283, output treesize:289 [2019-09-08 01:42:08,128 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:08,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-09-08 01:42:08,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:08,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:08,210 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_50|], 42=[|v_#memory_$Pointer$.offset_50|, |v_#memory_$Pointer$.base_55|]} [2019-09-08 01:42:08,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-09-08 01:42:08,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:08,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:08,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:08,507 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-08 01:42:08,508 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:08,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 12 case distinctions, treesize of input 268 treesize of output 381 [2019-09-08 01:42:08,516 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:08,696 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-09-08 01:42:08,696 INFO L567 ElimStorePlain]: treesize reduction 424, result has 41.8 percent of original size [2019-09-08 01:42:08,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:08,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:09,066 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-09-08 01:42:09,067 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:09,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 284 treesize of output 512 [2019-09-08 01:42:09,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:42:09,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:09,411 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:42:09,714 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 65 [2019-09-08 01:42:09,715 INFO L567 ElimStorePlain]: treesize reduction 526, result has 29.4 percent of original size [2019-09-08 01:42:09,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:42:09,717 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:331, output treesize:300 [2019-09-08 01:42:09,887 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-08 01:42:09,894 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_51|], 56=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_51|]} [2019-09-08 01:42:09,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2019-09-08 01:42:09,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:10,007 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-09-08 01:42:10,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:10,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:10,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:10,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:10,833 WARN L188 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 135 [2019-09-08 01:42:10,834 INFO L341 Elim1Store]: treesize reduction 116, result has 74.9 percent of original size [2019-09-08 01:42:10,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 299 treesize of output 497 [2019-09-08 01:42:10,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:10,931 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:42:11,210 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 75 [2019-09-08 01:42:11,211 INFO L567 ElimStorePlain]: treesize reduction 300, result has 45.2 percent of original size [2019-09-08 01:42:11,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:11,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:11,235 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:11,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 2 case distinctions, treesize of input 186 treesize of output 156 [2019-09-08 01:42:11,238 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:11,420 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-08 01:42:11,421 INFO L567 ElimStorePlain]: treesize reduction 80, result has 74.0 percent of original size [2019-09-08 01:42:11,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:42:11,422 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:351, output treesize:309 [2019-09-08 01:42:11,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:11,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:42:12,075 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-09-08 01:42:12,076 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:12,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 18 case distinctions, treesize of input 310 treesize of output 400 [2019-09-08 01:42:12,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:42:12,137 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 01:42:12,228 INFO L567 ElimStorePlain]: treesize reduction 160, result has 43.5 percent of original size [2019-09-08 01:42:12,251 INFO L341 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size [2019-09-08 01:42:12,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 60 [2019-09-08 01:42:12,254 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:12,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:12,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:42:12,270 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:339, output treesize:23 [2019-09-08 01:42:12,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-09-08 01:42:12,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:42:12,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:42:12,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:42:12,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:7 [2019-09-08 01:42:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:42:12,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:42:12,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-09-08 01:42:12,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 01:42:12,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 01:42:12,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:42:12,433 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand 16 states. [2019-09-08 01:42:13,307 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-08 01:42:13,640 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 01:42:14,101 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-08 01:42:14,554 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 126 [2019-09-08 01:42:14,949 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 137 [2019-09-08 01:42:15,237 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-08 01:42:15,531 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-09-08 01:42:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:42:16,286 INFO L93 Difference]: Finished difference Result 177 states and 216 transitions. [2019-09-08 01:42:16,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 01:42:16,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-09-08 01:42:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:42:16,289 INFO L225 Difference]: With dead ends: 177 [2019-09-08 01:42:16,289 INFO L226 Difference]: Without dead ends: 142 [2019-09-08 01:42:16,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2019-09-08 01:42:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-08 01:42:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 103. [2019-09-08 01:42:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-08 01:42:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2019-09-08 01:42:16,308 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 25 [2019-09-08 01:42:16,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:42:16,310 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2019-09-08 01:42:16,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 01:42:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2019-09-08 01:42:16,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:42:16,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:42:16,315 INFO L399 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, 1, 1, 1, 1, 1] [2019-09-08 01:42:16,316 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:42:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:42:16,316 INFO L82 PathProgramCache]: Analyzing trace with hash -791238755, now seen corresponding path program 1 times [2019-09-08 01:42:16,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:42:16,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:42:16,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:42:16,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:42:16,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:42:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:42:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:42:16,460 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-08 01:42:16,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 01:42:16 BoogieIcfgContainer [2019-09-08 01:42:16,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 01:42:16,549 INFO L168 Benchmark]: Toolchain (without parser) took 33808.30 ms. Allocated memory was 139.5 MB in the beginning and 484.4 MB in the end (delta: 345.0 MB). Free memory was 86.0 MB in the beginning and 457.4 MB in the end (delta: -371.4 MB). Peak memory consumption was 351.4 MB. Max. memory is 7.1 GB. [2019-09-08 01:42:16,549 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 105.7 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 01:42:16,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.55 ms. Allocated memory was 139.5 MB in the beginning and 216.5 MB in the end (delta: 77.1 MB). Free memory was 85.8 MB in the beginning and 189.8 MB in the end (delta: -104.0 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-09-08 01:42:16,550 INFO L168 Benchmark]: Boogie Preprocessor took 72.70 ms. Allocated memory is still 216.5 MB. Free memory was 189.8 MB in the beginning and 186.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-09-08 01:42:16,550 INFO L168 Benchmark]: RCFGBuilder took 793.71 ms. Allocated memory is still 216.5 MB. Free memory was 186.0 MB in the beginning and 133.5 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. [2019-09-08 01:42:16,551 INFO L168 Benchmark]: TraceAbstraction took 32291.54 ms. Allocated memory was 216.5 MB in the beginning and 484.4 MB in the end (delta: 267.9 MB). Free memory was 132.7 MB in the beginning and 457.4 MB in the end (delta: -324.7 MB). Peak memory consumption was 321.0 MB. Max. memory is 7.1 GB. [2019-09-08 01:42:16,552 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 105.7 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 646.55 ms. Allocated memory was 139.5 MB in the beginning and 216.5 MB in the end (delta: 77.1 MB). Free memory was 85.8 MB in the beginning and 189.8 MB in the end (delta: -104.0 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.70 ms. Allocated memory is still 216.5 MB. Free memory was 189.8 MB in the beginning and 186.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 793.71 ms. Allocated memory is still 216.5 MB. Free memory was 186.0 MB in the beginning and 133.5 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32291.54 ms. Allocated memory was 216.5 MB in the beginning and 484.4 MB in the end (delta: 267.9 MB). Free memory was 132.7 MB in the beginning and 457.4 MB in the end (delta: -324.7 MB). Peak memory consumption was 321.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1050]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L993] BCK* bucket = malloc(sizeof(BCK)); [L994] bucket->data = 0 [L995] bucket->list = ((void*)0) [L997] bucket->next = malloc(sizeof(BCK)) [L998] EXPR bucket->next [L998] BCK* bcki = bucket->next; [L999] bcki->data = 1 [L1000] bcki->list = ((void*)0) [L1002] bcki->next = malloc(sizeof(BCK)) [L1003] EXPR bcki->next [L1003] bcki = bcki->next [L1004] bcki->data = 2 [L1005] bcki->list = ((void*)0) [L1006] bcki->next = ((void*)0) [L1008] struct TSLL* item = ((void*)0); [L1009] struct TSLL* itr = ((void*)0); VAL [bcki={1:0}, bucket={3:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={3:0}, malloc(sizeof(BCK))={1:0}, malloc(sizeof(BCK))={2:0}] [L1010] COND TRUE __VERIFIER_nondet_int() [L1012] item = malloc(sizeof(SLL)) [L1013] item->next = ((void*)0) [L1014] COND TRUE __VERIFIER_nondet_int() [L1015] item->data = 0 VAL [bcki={1:0}, bucket={3:0}, item={-1:0}, itr={0:0}, malloc(sizeof(BCK))={3:0}, malloc(sizeof(BCK))={1:0}, malloc(sizeof(BCK))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1021] bcki = bucket VAL [bcki={3:0}, bucket={3:0}, item={-1:0}, itr={0:0}, malloc(sizeof(BCK))={3:0}, malloc(sizeof(BCK))={1:0}, malloc(sizeof(BCK))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1023] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={3:0}, bucket={3:0}, item={-1:0}, itr={0:0}, malloc(sizeof(BCK))={3:0}, malloc(sizeof(BCK))={1:0}, malloc(sizeof(BCK))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1024] COND FALSE !(!(item != ((void*)0))) VAL [bcki={3:0}, bucket={3:0}, item={-1:0}, itr={0:0}, malloc(sizeof(BCK))={3:0}, malloc(sizeof(BCK))={1:0}, malloc(sizeof(BCK))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1025] EXPR bcki->data [L1025] EXPR item->data VAL [bcki={3:0}, bcki->data=0, bucket={3:0}, item={-1:0}, item->data=0, itr={0:0}, malloc(sizeof(BCK))={3:0}, malloc(sizeof(BCK))={1:0}, malloc(sizeof(BCK))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1025] COND FALSE !(bcki->data != item->data) [L1027] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={3:0}, bucket={3:0}, item={-1:0}, itr={0:0}, malloc(sizeof(BCK))={3:0}, malloc(sizeof(BCK))={1:0}, malloc(sizeof(BCK))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1029] EXPR bcki->list VAL [bcki={3:0}, bcki->list={0:0}, bucket={3:0}, item={-1:0}, itr={0:0}, malloc(sizeof(BCK))={3:0}, malloc(sizeof(BCK))={1:0}, malloc(sizeof(BCK))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1029] COND TRUE bcki->list == ((void*)0) [L1030] bcki->list = item VAL [bcki={3:0}, bucket={3:0}, item={-1:0}, itr={0:0}, malloc(sizeof(BCK))={3:0}, malloc(sizeof(BCK))={1:0}, malloc(sizeof(BCK))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1041] bcki = bucket VAL [bcki={3:0}, bucket={3:0}, item={-1:0}, itr={0:0}, malloc(sizeof(BCK))={3:0}, malloc(sizeof(BCK))={1:0}, malloc(sizeof(BCK))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1042] COND TRUE bcki != ((void*)0) [L1044] EXPR bcki->list [L1044] item = bcki->list [L1045] bcki->list = ((void*)0) VAL [bcki={3:0}, bucket={3:0}, item={-1:0}, itr={0:0}, malloc(sizeof(BCK))={3:0}, malloc(sizeof(BCK))={1:0}, malloc(sizeof(BCK))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1046] COND TRUE item != ((void*)0) [L1048] itr = item [L1049] EXPR item->next [L1049] item = item->next [L1050] EXPR itr->data [L1050] EXPR bcki->data VAL [bcki={3:0}, bcki->data=0, bucket={3:0}, item={0:0}, itr={-1:0}, itr->data=0, malloc(sizeof(BCK))={3:0}, malloc(sizeof(BCK))={1:0}, malloc(sizeof(BCK))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1050] COND TRUE !(itr->data != bcki->data) [L1050] __VERIFIER_error() VAL [bcki={3:0}, bucket={3:0}, item={0:0}, itr={-1:0}, malloc(sizeof(BCK))={3:0}, malloc(sizeof(BCK))={1:0}, malloc(sizeof(BCK))={2:0}, malloc(sizeof(SLL))={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 5 error locations. UNSAFE Result, 32.2s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 9.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 365 SDtfs, 996 SDslu, 1527 SDs, 0 SdLazy, 1885 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 250 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 21.4s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 261 ConstructedInterpolants, 34 QuantifiedInterpolants, 261084 SizeOfPredicates, 73 NumberOfNonLiveVariables, 725 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 38/68 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...