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/list-ext2-properties/simple_and_skiplist_2lvl-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:01:59,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:01:59,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:01:59,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:01:59,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:01:59,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:01:59,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:01:59,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:01:59,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:01:59,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:01:59,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:01:59,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:01:59,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:01:59,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:01:59,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:01:59,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:01:59,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:01:59,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:01:59,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:01:59,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:01:59,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:01:59,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:01:59,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:01:59,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:01:59,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:01:59,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:01:59,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:01:59,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:01:59,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:01:59,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:01:59,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:01:59,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:01:59,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:01:59,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:01:59,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:01:59,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:01:59,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:01:59,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:01:59,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:01:59,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:01:59,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:01:59,195 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-20 13:01:59,209 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:01:59,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:01:59,210 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:01:59,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:01:59,211 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:01:59,211 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:01:59,211 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:01:59,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:01:59,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:01:59,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:01:59,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:01:59,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:01:59,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:01:59,213 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:01:59,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:01:59,213 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:01:59,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:01:59,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:01:59,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:01:59,214 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:01:59,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:01:59,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:01:59,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:01:59,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:01:59,215 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:01:59,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:01:59,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:01:59,216 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:01:59,216 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:01:59,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:01:59,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:01:59,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:01:59,273 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:01:59,274 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:01:59,274 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2019-09-20 13:01:59,346 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95522f288/1ccbacbabeb740eeb5ee12a7bb960561/FLAG83b579da6 [2019-09-20 13:01:59,883 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:01:59,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2019-09-20 13:01:59,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95522f288/1ccbacbabeb740eeb5ee12a7bb960561/FLAG83b579da6 [2019-09-20 13:02:00,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95522f288/1ccbacbabeb740eeb5ee12a7bb960561 [2019-09-20 13:02:00,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:02:00,197 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:02:00,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:02:00,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:02:00,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:02:00,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:02:00" (1/1) ... [2019-09-20 13:02:00,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b20aa1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:00, skipping insertion in model container [2019-09-20 13:02:00,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:02:00" (1/1) ... [2019-09-20 13:02:00,209 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:02:00,264 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:02:00,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:02:00,697 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:02:00,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:02:00,827 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:02:00,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:00 WrapperNode [2019-09-20 13:02:00,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:02:00,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:02:00,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:02:00,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:02:00,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:00" (1/1) ... [2019-09-20 13:02:00,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:00" (1/1) ... [2019-09-20 13:02:00,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:00" (1/1) ... [2019-09-20 13:02:00,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:00" (1/1) ... [2019-09-20 13:02:00,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:00" (1/1) ... [2019-09-20 13:02:00,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:00" (1/1) ... [2019-09-20 13:02:00,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:00" (1/1) ... [2019-09-20 13:02:00,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:02:00,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:02:00,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:02:00,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:02:00,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:00" (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-20 13:02:00,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:02:00,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:02:00,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-20 13:02:00,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-20 13:02:00,954 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-20 13:02:00,954 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die [2019-09-20 13:02:00,954 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sl_with_head_and_tail [2019-09-20 13:02:00,955 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_random_insert [2019-09-20 13:02:00,955 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sl [2019-09-20 13:02:00,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:02:00,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:02:00,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:02:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:02:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:02:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:02:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:02:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:02:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:02:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:02:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:02:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:02:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:02:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:02:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:02:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:02:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:02:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:02:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:02:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-20 13:02:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-20 13:02:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:02:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:02:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:02:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:02:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:02:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:02:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:02:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:02:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:02:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:02:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:02:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:02:00,961 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:02:00,961 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:02:00,961 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:02:00,961 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:02:00,961 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:02:00,961 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:02:00,962 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:02:00,962 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:02:00,962 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:02:00,962 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:02:00,962 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:02:00,962 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:02:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:02:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:02:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:02:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:02:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:02:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:02:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:02:00,964 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:02:00,964 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:02:00,964 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:02:00,964 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:02:00,964 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:02:00,964 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:02:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:02:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:02:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:02:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:02:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:02:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:02:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:02:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:02:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:02:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:02:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:02:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:02:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:02:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:02:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:02:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:02:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:02:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:02:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:02:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:02:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:02:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:02:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:02:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:02:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:02:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:02:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:02:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:02:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:02:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:02:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:02:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:02:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:02:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:02:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:02:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:02:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:02:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:02:00,971 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:02:00,971 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:02:00,971 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:02:00,971 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:02:00,971 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:02:00,971 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:02:00,971 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:02:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:02:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:02:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:02:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:02:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:02:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-20 13:02:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die [2019-09-20 13:02:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:02:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure create_sl_with_head_and_tail [2019-09-20 13:02:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:02:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:02:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure sl_random_insert [2019-09-20 13:02:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sl [2019-09-20 13:02:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:02:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:02:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:02:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:02:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:02:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:02:01,365 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-20 13:02:01,672 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:02:01,672 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-09-20 13:02:01,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:02:01 BoogieIcfgContainer [2019-09-20 13:02:01,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:02:01,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:02:01,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:02:01,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:02:01,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:02:00" (1/3) ... [2019-09-20 13:02:01,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f97fce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:02:01, skipping insertion in model container [2019-09-20 13:02:01,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:00" (2/3) ... [2019-09-20 13:02:01,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f97fce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:02:01, skipping insertion in model container [2019-09-20 13:02:01,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:02:01" (3/3) ... [2019-09-20 13:02:01,690 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-2.i [2019-09-20 13:02:01,700 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:02:01,714 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:02:01,731 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:02:01,763 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:02:01,763 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:02:01,763 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:02:01,764 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:02:01,764 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:02:01,764 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:02:01,764 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:02:01,764 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:02:01,764 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:02:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-09-20 13:02:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-20 13:02:01,788 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:01,789 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:01,791 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:01,798 INFO L82 PathProgramCache]: Analyzing trace with hash 407034730, now seen corresponding path program 1 times [2019-09-20 13:02:01,800 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:01,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:01,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:01,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:01,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:01,949 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-20 13:02:01,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:01,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:02:01,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:02:01,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:02:01,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:02:01,971 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2019-09-20 13:02:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:02,000 INFO L93 Difference]: Finished difference Result 92 states and 124 transitions. [2019-09-20 13:02:02,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:02:02,002 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-20 13:02:02,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:02,010 INFO L225 Difference]: With dead ends: 92 [2019-09-20 13:02:02,011 INFO L226 Difference]: Without dead ends: 18 [2019-09-20 13:02:02,015 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:02:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-20 13:02:02,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-20 13:02:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-20 13:02:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-20 13:02:02,053 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-20 13:02:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:02,054 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-20 13:02:02,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:02:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-20 13:02:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:02:02,055 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:02,055 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:02,056 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:02,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:02,056 INFO L82 PathProgramCache]: Analyzing trace with hash -709462780, now seen corresponding path program 1 times [2019-09-20 13:02:02,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:02,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:02,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:02,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:02,190 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-20 13:02:02,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:02,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:02:02,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:02:02,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:02:02,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:02:02,193 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2019-09-20 13:02:02,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:02,290 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-09-20 13:02:02,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:02:02,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-20 13:02:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:02,293 INFO L225 Difference]: With dead ends: 33 [2019-09-20 13:02:02,293 INFO L226 Difference]: Without dead ends: 31 [2019-09-20 13:02:02,295 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:02:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-20 13:02:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-09-20 13:02:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-20 13:02:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-20 13:02:02,304 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2019-09-20 13:02:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:02,304 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-20 13:02:02,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:02:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-20 13:02:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:02:02,306 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:02,306 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:02,306 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:02,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:02,307 INFO L82 PathProgramCache]: Analyzing trace with hash -66753378, now seen corresponding path program 1 times [2019-09-20 13:02:02,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:02,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:02,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:02,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:02,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:02,478 INFO L224 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:02,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:02,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-20 13:02:02,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:02,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:02,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:02,716 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,724 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-09-20 13:02:02,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:02:02,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:02:02,759 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,765 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-20 13:02:02,765 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-09-20 13:02:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:02,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:02,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-20 13:02:02,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:02:02,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:02:02,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:02:02,777 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2019-09-20 13:02:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:02,884 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-20 13:02:02,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:02:02,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-20 13:02:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:02,886 INFO L225 Difference]: With dead ends: 37 [2019-09-20 13:02:02,886 INFO L226 Difference]: Without dead ends: 27 [2019-09-20 13:02:02,887 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:02:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-20 13:02:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-09-20 13:02:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-20 13:02:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-20 13:02:02,894 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-09-20 13:02:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:02,894 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-20 13:02:02,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:02:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-20 13:02:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:02:02,895 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:02,896 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:02,896 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:02,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1381959275, now seen corresponding path program 1 times [2019-09-20 13:02:02,897 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:02,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:02,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:02,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:03,066 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-20 13:02:03,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:03,067 INFO L224 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-20 13:02:03,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:03,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-20 13:02:03,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:03,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:03,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:03,290 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,291 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 11 treesize of output 15 [2019-09-20 13:02:03,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:03,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,348 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-09-20 13:02:03,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:02:03,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-09-20 13:02:03,444 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-09-20 13:02:03,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2019-09-20 13:02:03,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:03,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-09-20 13:02:03,498 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 22 treesize of output 10 [2019-09-20 13:02:03,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-09-20 13:02:03,508 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-20 13:02:03,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:03,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-09-20 13:02:03,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:02:03,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:02:03,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:02:03,513 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 13 states. [2019-09-20 13:02:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:03,780 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-20 13:02:03,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:02:03,782 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2019-09-20 13:02:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:03,783 INFO L225 Difference]: With dead ends: 37 [2019-09-20 13:02:03,783 INFO L226 Difference]: Without dead ends: 35 [2019-09-20 13:02:03,784 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:02:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-20 13:02:03,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-09-20 13:02:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-20 13:02:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-20 13:02:03,789 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-09-20 13:02:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:03,789 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-20 13:02:03,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:02:03,789 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-20 13:02:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:02:03,790 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:03,790 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:03,791 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:03,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:03,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1602875945, now seen corresponding path program 1 times [2019-09-20 13:02:03,791 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:03,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:03,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:03,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:03,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:03,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:03,968 INFO L224 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-20 13:02:04,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:04,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-20 13:02:04,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:04,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:04,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:04,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,108 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 11 treesize of output 15 [2019-09-20 13:02:04,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-09-20 13:02:04,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:04,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:04,159 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,171 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-20 13:02:04,171 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-09-20 13:02:04,217 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-20 13:02:04,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,259 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-20 13:02:04,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2019-09-20 13:02:04,288 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-09-20 13:02:04,313 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2019-09-20 13:02:04,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:04,365 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,409 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.2 percent of original size [2019-09-20 13:02:04,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,410 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:141, output treesize:52 [2019-09-20 13:02:04,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 36 [2019-09-20 13:02:04,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,489 INFO L567 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2019-09-20 13:02:04,495 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 22 treesize of output 10 [2019-09-20 13:02:04,496 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,525 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-20 13:02:04,525 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:11 [2019-09-20 13:02:04,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:02:04,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-20 13:02:04,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:04,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:04,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-20 13:02:04,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:02:04,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:02:04,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:02:04,566 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 10 states. [2019-09-20 13:02:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:04,804 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-09-20 13:02:04,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:02:04,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-09-20 13:02:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:04,807 INFO L225 Difference]: With dead ends: 40 [2019-09-20 13:02:04,807 INFO L226 Difference]: Without dead ends: 38 [2019-09-20 13:02:04,808 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:02:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-20 13:02:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-09-20 13:02:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-20 13:02:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-20 13:02:04,813 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2019-09-20 13:02:04,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:04,814 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-20 13:02:04,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:02:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-20 13:02:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:02:04,815 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:04,815 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:04,815 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:04,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:04,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1006799954, now seen corresponding path program 2 times [2019-09-20 13:02:04,815 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:04,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:04,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:04,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:04,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:04,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:04,970 INFO L224 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:05,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:02:05,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:02:05,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:05,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-20 13:02:05,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:05,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:05,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:05,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,101 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 11 treesize of output 15 [2019-09-20 13:02:05,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:05,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,125 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-09-20 13:02:05,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:05,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:02:05,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-09-20 13:02:05,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:05,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-20 13:02:05,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-09-20 13:02:05,209 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-09-20 13:02:05,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:02:05,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:05,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-09-20 13:02:05,330 INFO L341 Elim1Store]: treesize reduction 27, result has 69.7 percent of original size [2019-09-20 13:02:05,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 75 [2019-09-20 13:02:05,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,377 INFO L567 ElimStorePlain]: treesize reduction 39, result has 48.7 percent of original size [2019-09-20 13:02:05,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:05,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:37 [2019-09-20 13:02:05,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,416 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 26 treesize of output 14 [2019-09-20 13:02:05,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,429 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2019-09-20 13:02:05,430 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,441 INFO L567 ElimStorePlain]: treesize reduction 17, result has 32.0 percent of original size [2019-09-20 13:02:05,442 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-20 13:02:05,442 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:3 [2019-09-20 13:02:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:05,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:05,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2019-09-20 13:02:05,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:02:05,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:02:05,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:02:05,449 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 13 states. [2019-09-20 13:02:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:05,910 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-09-20 13:02:05,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:02:05,913 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-09-20 13:02:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:05,914 INFO L225 Difference]: With dead ends: 47 [2019-09-20 13:02:05,914 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 13:02:05,915 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:02:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 13:02:05,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-09-20 13:02:05,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-20 13:02:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-09-20 13:02:05,922 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2019-09-20 13:02:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:05,922 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-09-20 13:02:05,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:02:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-09-20 13:02:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:02:05,923 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:05,923 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:05,924 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:05,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:05,924 INFO L82 PathProgramCache]: Analyzing trace with hash 173981419, now seen corresponding path program 2 times [2019-09-20 13:02:05,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:05,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:05,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:05,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:05,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:06,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:06,143 INFO L224 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:06,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:02:06,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:02:06,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:06,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-20 13:02:06,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:06,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:06,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:06,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,295 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 11 treesize of output 15 [2019-09-20 13:02:06,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-09-20 13:02:06,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:06,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:06,338 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,353 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-20 13:02:06,353 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-09-20 13:02:06,369 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-20 13:02:06,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,405 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 71 [2019-09-20 13:02:06,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,409 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-09-20 13:02:06,462 INFO L567 ElimStorePlain]: treesize reduction 85, result has 50.9 percent of original size [2019-09-20 13:02:06,466 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-20 13:02:06,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-09-20 13:02:06,488 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,513 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:111, output treesize:41 [2019-09-20 13:02:06,578 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:06,589 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-20 13:02:06,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 45 [2019-09-20 13:02:06,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:06,593 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-20 13:02:06,623 INFO L567 ElimStorePlain]: treesize reduction 8, result has 81.4 percent of original size [2019-09-20 13:02:06,630 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-09-20 13:02:06,631 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,637 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-20 13:02:06,637 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:7 [2019-09-20 13:02:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:06,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:06,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-09-20 13:02:06,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:02:06,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:02:06,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:02:06,648 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2019-09-20 13:02:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:06,910 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-09-20 13:02:06,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:02:06,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-20 13:02:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:06,911 INFO L225 Difference]: With dead ends: 49 [2019-09-20 13:02:06,911 INFO L226 Difference]: Without dead ends: 36 [2019-09-20 13:02:06,912 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:02:06,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-20 13:02:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-09-20 13:02:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-20 13:02:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-20 13:02:06,918 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2019-09-20 13:02:06,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:06,918 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-20 13:02:06,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:02:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-20 13:02:06,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:02:06,919 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:06,919 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:06,920 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:06,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:06,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1825663632, now seen corresponding path program 3 times [2019-09-20 13:02:06,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:06,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:06,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:06,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:06,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:07,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:07,264 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:07,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:02:07,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-20 13:02:07,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:07,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-20 13:02:07,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:07,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:07,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:07,440 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:02:07,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,468 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-09-20 13:02:07,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-09-20 13:02:07,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:07,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:07,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,528 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-20 13:02:07,529 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-09-20 13:02:07,558 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-09-20 13:02:07,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,592 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_48|], 2=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_50|]} [2019-09-20 13:02:07,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:07,603 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,634 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-20 13:02:07,635 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,660 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-20 13:02:07,661 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,683 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-20 13:02:07,683 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:43 [2019-09-20 13:02:07,716 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_49|], 1=[|v_#memory_$Pointer$.base_51|, |v_#memory_$Pointer$.offset_50|]} [2019-09-20 13:02:07,721 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 39 treesize of output 15 [2019-09-20 13:02:07,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 74 [2019-09-20 13:02:07,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,769 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,817 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.5 percent of original size [2019-09-20 13:02:07,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:07,830 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 27 treesize of output 22 [2019-09-20 13:02:07,831 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,851 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:129, output treesize:83 [2019-09-20 13:02:07,892 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_47|], 4=[|v_#memory_int_50|], 5=[|v_#memory_$Pointer$.offset_51|, |v_#memory_$Pointer$.base_52|]} [2019-09-20 13:02:07,896 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-20 13:02:07,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,945 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-20 13:02:07,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:07,990 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 82 treesize of output 38 [2019-09-20 13:02:07,991 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,043 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 134 [2019-09-20 13:02:08,045 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,098 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 118 [2019-09-20 13:02:08,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,106 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,190 INFO L567 ElimStorePlain]: treesize reduction 184, result has 42.7 percent of original size [2019-09-20 13:02:08,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,191 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:315, output treesize:106 [2019-09-20 13:02:08,260 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 73 [2019-09-20 13:02:08,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,266 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-20 13:02:08,314 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.3 percent of original size [2019-09-20 13:02:08,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-09-20 13:02:08,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:08,332 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:22 [2019-09-20 13:02:08,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-09-20 13:02:08,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-20 13:02:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:08,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:08,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2019-09-20 13:02:08,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 13:02:08,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 13:02:08,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:02:08,376 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 15 states. [2019-09-20 13:02:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:08,926 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-09-20 13:02:08,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:02:08,926 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-09-20 13:02:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:08,927 INFO L225 Difference]: With dead ends: 47 [2019-09-20 13:02:08,927 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 13:02:08,928 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2019-09-20 13:02:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 13:02:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2019-09-20 13:02:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-20 13:02:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-09-20 13:02:08,933 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 25 [2019-09-20 13:02:08,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:08,934 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-09-20 13:02:08,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:02:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-09-20 13:02:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:02:08,935 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:08,935 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:08,935 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:08,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:08,936 INFO L82 PathProgramCache]: Analyzing trace with hash -82655559, now seen corresponding path program 3 times [2019-09-20 13:02:08,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:08,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:08,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:08,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:08,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:09,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:09,142 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:09,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:02:09,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-20 13:02:09,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:09,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-20 13:02:09,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:09,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:09,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:09,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:09,343 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:09,344 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 11 treesize of output 15 [2019-09-20 13:02:09,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:09,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:09,356 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:09,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,365 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-09-20 13:02:09,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:09,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:02:09,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:09,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-09-20 13:02:09,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:09,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-20 13:02:09,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:09,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-09-20 13:02:09,472 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-09-20 13:02:09,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:02:09,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:09,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:09,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-09-20 13:02:09,544 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:09,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 26 treesize of output 68 [2019-09-20 13:02:09,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,589 INFO L567 ElimStorePlain]: treesize reduction 40, result has 46.7 percent of original size [2019-09-20 13:02:09,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:09,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-09-20 13:02:09,682 INFO L341 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2019-09-20 13:02:09,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 59 [2019-09-20 13:02:09,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,721 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-09-20 13:02:09,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:09,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:40 [2019-09-20 13:02:09,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,828 INFO L341 Elim1Store]: treesize reduction 27, result has 69.7 percent of original size [2019-09-20 13:02:09,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 75 [2019-09-20 13:02:09,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,877 INFO L567 ElimStorePlain]: treesize reduction 39, result has 48.7 percent of original size [2019-09-20 13:02:09,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:09,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:37 [2019-09-20 13:02:09,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:09,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2019-09-20 13:02:09,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,927 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 26 treesize of output 14 [2019-09-20 13:02:09,927 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:09,941 INFO L567 ElimStorePlain]: treesize reduction 17, result has 32.0 percent of original size [2019-09-20 13:02:09,941 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-20 13:02:09,942 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:3 [2019-09-20 13:02:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:02:09,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:09,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2019-09-20 13:02:09,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-20 13:02:09,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-20 13:02:09,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:02:09,954 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 17 states. [2019-09-20 13:02:10,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:10,387 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-20 13:02:10,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:02:10,388 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-09-20 13:02:10,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:10,389 INFO L225 Difference]: With dead ends: 42 [2019-09-20 13:02:10,389 INFO L226 Difference]: Without dead ends: 40 [2019-09-20 13:02:10,389 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2019-09-20 13:02:10,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-20 13:02:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-09-20 13:02:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-20 13:02:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-09-20 13:02:10,396 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 26 [2019-09-20 13:02:10,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:10,396 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-09-20 13:02:10,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-20 13:02:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-09-20 13:02:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:02:10,397 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:10,397 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:10,397 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:10,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1370635575, now seen corresponding path program 4 times [2019-09-20 13:02:10,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:10,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:10,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:10,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:10,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:10,804 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:10,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:02:10,916 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:02:10,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:10,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-20 13:02:10,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:10,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:10,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:10,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:10,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:10,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:10,953 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:10,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:02:10,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:10,983 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-09-20 13:02:10,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:10,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-09-20 13:02:10,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:10,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:11,017 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,031 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-20 13:02:11,032 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-09-20 13:02:11,087 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-09-20 13:02:11,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,173 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-09-20 13:02:11,175 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_58|], 2=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_56|]} [2019-09-20 13:02:11,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:11,181 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,220 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-20 13:02:11,221 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,252 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-20 13:02:11,253 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,274 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-20 13:02:11,274 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:87, output treesize:55 [2019-09-20 13:02:11,320 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_59|], 1=[|v_#memory_$Pointer$.base_57|, |v_#memory_$Pointer$.offset_57|]} [2019-09-20 13:02:11,325 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 39 treesize of output 15 [2019-09-20 13:02:11,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,369 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 72 [2019-09-20 13:02:11,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,425 INFO L567 ElimStorePlain]: treesize reduction 8, result has 92.2 percent of original size [2019-09-20 13:02:11,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:11,432 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 27 treesize of output 22 [2019-09-20 13:02:11,433 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,458 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:137, output treesize:88 [2019-09-20 13:02:11,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:11,524 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,525 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-20 13:02:11,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,560 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_60|, |v_#memory_$Pointer$.offset_58|], 5=[|v_#memory_$Pointer$.base_58|]} [2019-09-20 13:02:11,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:11,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-09-20 13:02:11,567 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:11,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-20 13:02:11,610 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,701 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-09-20 13:02:11,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 68 [2019-09-20 13:02:11,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,705 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-20 13:02:11,762 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.1 percent of original size [2019-09-20 13:02:11,763 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-20 13:02:11,764 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:134, output treesize:68 [2019-09-20 13:02:11,812 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_59|], 5=[|v_#memory_$Pointer$.base_59|], 6=[|v_#memory_int_61|]} [2019-09-20 13:02:11,818 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 0 case distinctions, treesize of input 37 treesize of output 28 [2019-09-20 13:02:11,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,902 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 161 [2019-09-20 13:02:11,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:11,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:12,021 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-20 13:02:12,021 INFO L567 ElimStorePlain]: treesize reduction 84, result has 68.5 percent of original size [2019-09-20 13:02:12,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:12,030 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 70 treesize of output 33 [2019-09-20 13:02:12,030 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:12,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:12,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:12,062 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:207, output treesize:148 [2019-09-20 13:02:12,131 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_60|, |v_#memory_$Pointer$.offset_54|, |v_#memory_$Pointer$.base_54|], 10=[|v_#memory_int_62|], 11=[|v_#memory_$Pointer$.base_60|]} [2019-09-20 13:02:12,141 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 65 treesize of output 11 [2019-09-20 13:02:12,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:12,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:12,210 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 49 treesize of output 34 [2019-09-20 13:02:12,211 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:12,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:12,268 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-20 13:02:12,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:12,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:12,328 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 91 treesize of output 54 [2019-09-20 13:02:12,329 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:12,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:12,613 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-20 13:02:12,614 INFO L341 Elim1Store]: treesize reduction 101, result has 64.1 percent of original size [2019-09-20 13:02:12,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 209 treesize of output 248 [2019-09-20 13:02:12,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:12,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:12,651 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 11 xjuncts. [2019-09-20 13:02:13,039 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-09-20 13:02:13,039 INFO L567 ElimStorePlain]: treesize reduction 7114, result has 3.0 percent of original size [2019-09-20 13:02:13,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:13,041 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:391, output treesize:198 [2019-09-20 13:02:13,098 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 11=[|#memory_$Pointer$.base|]} [2019-09-20 13:02:13,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 10 [2019-09-20 13:02:13,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:13,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:13,179 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:13,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 172 treesize of output 137 [2019-09-20 13:02:13,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:13,200 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:13,261 INFO L567 ElimStorePlain]: treesize reduction 76, result has 39.2 percent of original size [2019-09-20 13:02:13,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:13,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:209, output treesize:37 [2019-09-20 13:02:13,305 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 29 treesize of output 13 [2019-09-20 13:02:13,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:13,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:13,313 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-20 13:02:13,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-09-20 13:02:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:13,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:13,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-09-20 13:02:13,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-20 13:02:13,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-20 13:02:13,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:02:13,336 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 19 states. [2019-09-20 13:02:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:14,281 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-09-20 13:02:14,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 13:02:14,287 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-09-20 13:02:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:14,290 INFO L225 Difference]: With dead ends: 66 [2019-09-20 13:02:14,290 INFO L226 Difference]: Without dead ends: 64 [2019-09-20 13:02:14,294 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-09-20 13:02:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-20 13:02:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2019-09-20 13:02:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-20 13:02:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-09-20 13:02:14,302 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 29 [2019-09-20 13:02:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:14,303 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-09-20 13:02:14,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-20 13:02:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-09-20 13:02:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:02:14,304 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:14,304 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:14,304 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:14,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:14,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1682132144, now seen corresponding path program 5 times [2019-09-20 13:02:14,305 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:14,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:14,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:14,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:14,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:14,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:14,770 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:14,860 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-20 13:02:14,897 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-20 13:02:14,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:14,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-20 13:02:14,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:14,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:14,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:14,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:14,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:14,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-09-20 13:02:14,972 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:14,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:02:14,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:15,001 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-09-20 13:02:15,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:15,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-09-20 13:02:15,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-20 13:02:15,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:15,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:15,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-20 13:02:15,060 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:15,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:15,075 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-20 13:02:15,075 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:54 [2019-09-20 13:02:15,152 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:15,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-09-20 13:02:15,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:15,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:15,242 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-09-20 13:02:15,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2019-09-20 13:02:15,243 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:15,280 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.3 percent of original size [2019-09-20 13:02:15,283 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 34 treesize of output 16 [2019-09-20 13:02:15,283 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:15,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:15,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:15,299 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:92, output treesize:43 [2019-09-20 13:02:15,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:15,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 131 [2019-09-20 13:02:15,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:15,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:15,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-20 13:02:15,423 INFO L567 ElimStorePlain]: treesize reduction 130, result has 49.8 percent of original size [2019-09-20 13:02:15,428 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 96 [2019-09-20 13:02:15,429 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:15,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:15,457 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-20 13:02:15,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:138, output treesize:133 [2019-09-20 13:02:15,503 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_61|, |v_#memory_$Pointer$.offset_61|], 6=[|v_#memory_$Pointer$.offset_65|, |v_#memory_$Pointer$.base_65|]} [2019-09-20 13:02:15,506 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-20 13:02:15,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:15,535 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-20 13:02:15,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:15,701 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-20 13:02:15,701 INFO L341 Elim1Store]: treesize reduction 70, result has 66.7 percent of original size [2019-09-20 13:02:15,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 259 [2019-09-20 13:02:15,704 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:15,762 INFO L567 ElimStorePlain]: treesize reduction 123, result has 52.3 percent of original size [2019-09-20 13:02:15,871 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-20 13:02:15,872 INFO L341 Elim1Store]: treesize reduction 9, result has 92.2 percent of original size [2019-09-20 13:02:15,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 159 [2019-09-20 13:02:15,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:15,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:15,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:15,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:15,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:15,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:15,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:15,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:15,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:15,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:15,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:15,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:15,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:15,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:15,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:15,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:15,887 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2019-09-20 13:02:16,007 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2019-09-20 13:02:16,008 INFO L567 ElimStorePlain]: treesize reduction 1772, result has 7.1 percent of original size [2019-09-20 13:02:16,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:16,008 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:435, output treesize:101 [2019-09-20 13:02:16,228 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:16,410 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-20 13:02:16,411 INFO L341 Elim1Store]: treesize reduction 8, result has 93.8 percent of original size [2019-09-20 13:02:16,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 182 treesize of output 199 [2019-09-20 13:02:16,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:16,524 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-20 13:02:16,601 INFO L567 ElimStorePlain]: treesize reduction 165, result has 26.7 percent of original size [2019-09-20 13:02:16,619 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:16,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 39 [2019-09-20 13:02:16,620 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:16,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:16,633 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-20 13:02:16,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:191, output treesize:7 [2019-09-20 13:02:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:16,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:16,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-09-20 13:02:16,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 13:02:16,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 13:02:16,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:02:16,658 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 21 states. [2019-09-20 13:02:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:19,498 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-09-20 13:02:19,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:02:19,498 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-09-20 13:02:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:19,499 INFO L225 Difference]: With dead ends: 61 [2019-09-20 13:02:19,500 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 13:02:19,500 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-09-20 13:02:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 13:02:19,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-09-20 13:02:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-20 13:02:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-09-20 13:02:19,506 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 31 [2019-09-20 13:02:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:19,507 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-09-20 13:02:19,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 13:02:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-09-20 13:02:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:02:19,508 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:19,508 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:19,508 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:19,508 INFO L82 PathProgramCache]: Analyzing trace with hash -345469767, now seen corresponding path program 6 times [2019-09-20 13:02:19,509 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:19,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:19,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:20,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:20,085 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:20,174 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-20 13:02:20,221 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-20 13:02:20,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:20,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-20 13:02:20,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:20,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:20,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:20,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:20,268 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:20,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:02:20,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,301 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-09-20 13:02:20,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-09-20 13:02:20,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:20,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:20,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:20,340 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:20,356 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-20 13:02:20,356 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-09-20 13:02:20,401 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:20,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-09-20 13:02:20,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,480 INFO L567 ElimStorePlain]: treesize reduction 28, result has 74.3 percent of original size [2019-09-20 13:02:20,486 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-20 13:02:20,487 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:20,521 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-20 13:02:20,521 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:20,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,549 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:51 [2019-09-20 13:02:20,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:20,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 72 [2019-09-20 13:02:20,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:20,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,705 INFO L567 ElimStorePlain]: treesize reduction 24, result has 79.7 percent of original size [2019-09-20 13:02:20,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:20,719 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 27 treesize of output 22 [2019-09-20 13:02:20,719 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:20,760 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-20 13:02:20,760 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:99 [2019-09-20 13:02:20,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:20,911 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:20,912 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-20 13:02:20,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:20,967 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_63|], 5=[|v_#memory_$Pointer$.offset_70|, |v_#memory_$Pointer$.base_70|]} [2019-09-20 13:02:20,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:20,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:21,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:21,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:21,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:21,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:21,044 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 45 treesize of output 28 [2019-09-20 13:02:21,045 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:21,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:21,101 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:21,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 52 [2019-09-20 13:02:21,102 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:21,166 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.6 percent of original size [2019-09-20 13:02:21,166 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-20 13:02:21,167 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:145, output treesize:71 [2019-09-20 13:02:21,243 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_64|], 5=[|v_#memory_$Pointer$.offset_71|, |v_#memory_$Pointer$.base_71|]} [2019-09-20 13:02:21,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:21,251 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 0 case distinctions, treesize of input 83 treesize of output 27 [2019-09-20 13:02:21,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:21,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:21,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:21,309 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 106 [2019-09-20 13:02:21,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:21,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:21,390 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:21,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 112 [2019-09-20 13:02:21,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,395 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:21,477 INFO L567 ElimStorePlain]: treesize reduction 100, result has 51.5 percent of original size [2019-09-20 13:02:21,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:21,478 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:255, output treesize:112 [2019-09-20 13:02:21,533 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_66|, |v_#memory_$Pointer$.base_66|], 4=[|v_#memory_int_65|], 5=[|v_#memory_$Pointer$.offset_72|], 9=[|v_#memory_$Pointer$.base_72|]} [2019-09-20 13:02:21,538 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-20 13:02:21,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:21,610 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-20 13:02:21,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:21,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:21,664 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 0 case distinctions, treesize of input 74 treesize of output 38 [2019-09-20 13:02:21,664 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:21,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:21,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:21,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:21,719 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 59 treesize of output 65 [2019-09-20 13:02:21,719 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:21,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:21,960 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-20 13:02:21,960 INFO L341 Elim1Store]: treesize reduction 95, result has 62.5 percent of original size [2019-09-20 13:02:21,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 186 treesize of output 225 [2019-09-20 13:02:21,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:21,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:21,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:22,029 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 9 xjuncts. [2019-09-20 13:02:22,222 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-20 13:02:22,222 INFO L567 ElimStorePlain]: treesize reduction 6138, result has 3.1 percent of original size [2019-09-20 13:02:22,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:22,223 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:331, output treesize:158 [2019-09-20 13:02:22,375 INFO L392 ElimStorePlain]: Different costs {11=[|#memory_$Pointer$.offset|], 17=[|#memory_$Pointer$.base|]} [2019-09-20 13:02:22,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:22,383 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:22,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 39 [2019-09-20 13:02:22,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:22,447 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:22,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 108 [2019-09-20 13:02:22,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,458 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:22,528 INFO L567 ElimStorePlain]: treesize reduction 54, result has 43.8 percent of original size [2019-09-20 13:02:22,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:22,530 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:189, output treesize:22 [2019-09-20 13:02:22,569 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 22 treesize of output 10 [2019-09-20 13:02:22,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:22,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-09-20 13:02:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:22,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:22,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2019-09-20 13:02:22,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 13:02:22,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 13:02:22,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:02:22,588 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 21 states. [2019-09-20 13:02:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:23,633 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-09-20 13:02:23,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-20 13:02:23,634 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2019-09-20 13:02:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:23,635 INFO L225 Difference]: With dead ends: 57 [2019-09-20 13:02:23,635 INFO L226 Difference]: Without dead ends: 55 [2019-09-20 13:02:23,636 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2019-09-20 13:02:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-20 13:02:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2019-09-20 13:02:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-20 13:02:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-09-20 13:02:23,644 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 32 [2019-09-20 13:02:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:23,644 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-09-20 13:02:23,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 13:02:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-09-20 13:02:23,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:02:23,645 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:23,646 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:23,646 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:23,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:23,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1143325495, now seen corresponding path program 7 times [2019-09-20 13:02:23,646 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:23,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:23,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:23,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:23,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:24,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:24,371 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:24,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:24,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-20 13:02:24,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:24,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:24,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:24,605 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:02:24,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,643 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-09-20 13:02:24,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-09-20 13:02:24,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:24,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:24,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,694 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-20 13:02:24,695 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-09-20 13:02:24,739 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-09-20 13:02:24,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,826 INFO L567 ElimStorePlain]: treesize reduction 28, result has 74.3 percent of original size [2019-09-20 13:02:24,832 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-20 13:02:24,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,863 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-20 13:02:24,863 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,886 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:51 [2019-09-20 13:02:24,953 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 27 treesize of output 22 [2019-09-20 13:02:24,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:24,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,996 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:24,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2019-09-20 13:02:24,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,999 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:25,045 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.5 percent of original size [2019-09-20 13:02:25,046 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-20 13:02:25,046 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:99 [2019-09-20 13:02:25,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:25,128 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:25,129 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-20 13:02:25,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:25,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:25,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:25,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:25,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:25,182 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 45 treesize of output 28 [2019-09-20 13:02:25,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:25,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:25,282 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-09-20 13:02:25,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 75 [2019-09-20 13:02:25,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:25,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:25,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:25,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:25,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:25,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:25,286 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-20 13:02:25,348 INFO L567 ElimStorePlain]: treesize reduction 24, result has 72.1 percent of original size [2019-09-20 13:02:25,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:25,349 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:137, output treesize:75 [2019-09-20 13:02:25,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:25,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 159 [2019-09-20 13:02:25,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:25,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:25,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:25,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:25,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:25,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:25,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:25,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:25,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:25,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:25,657 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-20 13:02:25,657 INFO L567 ElimStorePlain]: treesize reduction 1371, result has 10.4 percent of original size [2019-09-20 13:02:25,710 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:25,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 212 [2019-09-20 13:02:25,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:25,777 INFO L567 ElimStorePlain]: treesize reduction 76, result has 58.2 percent of original size [2019-09-20 13:02:25,777 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-20 13:02:25,778 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:198, output treesize:127 [2019-09-20 13:02:25,844 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_66|], 2=[|v_#memory_$Pointer$.base_73|, |v_#memory_$Pointer$.offset_73|], 9=[|v_#memory_$Pointer$.base_79|, |v_#memory_$Pointer$.offset_79|]} [2019-09-20 13:02:25,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:25,853 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 94 treesize of output 31 [2019-09-20 13:02:25,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:25,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:25,913 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-20 13:02:25,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:25,965 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-20 13:02:25,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:26,229 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-20 13:02:26,230 INFO L341 Elim1Store]: treesize reduction 69, result has 70.1 percent of original size [2019-09-20 13:02:26,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 246 treesize of output 255 [2019-09-20 13:02:26,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:26,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:26,436 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2019-09-20 13:02:26,853 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 50 [2019-09-20 13:02:26,853 INFO L567 ElimStorePlain]: treesize reduction 10866, result has 2.3 percent of original size [2019-09-20 13:02:26,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:26,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:26,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:26,880 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:26,881 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 236 [2019-09-20 13:02:26,882 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:26,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:26,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:26,916 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:439, output treesize:154 [2019-09-20 13:02:27,120 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:27,290 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-20 13:02:27,291 INFO L341 Elim1Store]: treesize reduction 24, result has 83.1 percent of original size [2019-09-20 13:02:27,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 218 treesize of output 210 [2019-09-20 13:02:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,567 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:27,664 INFO L567 ElimStorePlain]: treesize reduction 155, result has 34.6 percent of original size [2019-09-20 13:02:27,676 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:27,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 42 [2019-09-20 13:02:27,677 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:27,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:27,692 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-20 13:02:27,692 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:225, output treesize:11 [2019-09-20 13:02:27,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:02:27,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:27,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:27,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:27,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-20 13:02:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:27,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:27,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2019-09-20 13:02:27,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-20 13:02:27,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-20 13:02:27,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-09-20 13:02:27,759 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 23 states. [2019-09-20 13:02:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:28,633 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-09-20 13:02:28,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 13:02:28,634 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2019-09-20 13:02:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:28,635 INFO L225 Difference]: With dead ends: 60 [2019-09-20 13:02:28,635 INFO L226 Difference]: Without dead ends: 58 [2019-09-20 13:02:28,636 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2019-09-20 13:02:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-20 13:02:28,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2019-09-20 13:02:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-20 13:02:28,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-09-20 13:02:28,644 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 35 [2019-09-20 13:02:28,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:28,645 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-09-20 13:02:28,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-20 13:02:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-09-20 13:02:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 13:02:28,646 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:28,646 INFO L407 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:28,646 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:28,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:28,647 INFO L82 PathProgramCache]: Analyzing trace with hash -822332832, now seen corresponding path program 8 times [2019-09-20 13:02:28,647 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:28,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:28,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:28,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:28,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:29,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:29,273 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:29,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:02:29,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:02:29,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:29,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-20 13:02:29,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:29,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:29,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:29,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-20 13:02:29,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,476 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-09-20 13:02:29,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-09-20 13:02:29,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:29,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:29,518 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,535 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-20 13:02:29,535 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-09-20 13:02:29,584 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-09-20 13:02:29,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,662 INFO L567 ElimStorePlain]: treesize reduction 28, result has 73.6 percent of original size [2019-09-20 13:02:29,667 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-20 13:02:29,668 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,700 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-20 13:02:29,700 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,723 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:76, output treesize:48 [2019-09-20 13:02:29,788 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 72 [2019-09-20 13:02:29,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:29,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:29,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,850 INFO L567 ElimStorePlain]: treesize reduction 8, result has 92.2 percent of original size [2019-09-20 13:02:29,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:29,856 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 27 treesize of output 22 [2019-09-20 13:02:29,857 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,884 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-20 13:02:29,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:88 [2019-09-20 13:02:29,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:29,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 159 [2019-09-20 13:02:29,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,131 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-20 13:02:30,131 INFO L567 ElimStorePlain]: treesize reduction 78, result has 66.9 percent of original size [2019-09-20 13:02:30,133 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_67|], 5=[|v_#memory_$Pointer$.base_84|, |v_#memory_$Pointer$.offset_84|]} [2019-09-20 13:02:30,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:30,138 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,242 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-09-20 13:02:30,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 78 [2019-09-20 13:02:30,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,246 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-20 13:02:30,348 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-20 13:02:30,348 INFO L567 ElimStorePlain]: treesize reduction 24, result has 79.7 percent of original size [2019-09-20 13:02:30,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:30,357 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 30 treesize of output 21 [2019-09-20 13:02:30,357 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,398 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-20 13:02:30,398 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:140, output treesize:92 [2019-09-20 13:02:30,470 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_68|], 5=[|v_#memory_$Pointer$.base_85|, |v_#memory_$Pointer$.offset_85|]} [2019-09-20 13:02:30,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:30,477 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 0 case distinctions, treesize of input 83 treesize of output 27 [2019-09-20 13:02:30,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,571 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 160 [2019-09-20 13:02:30,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,574 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,677 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-20 13:02:30,678 INFO L567 ElimStorePlain]: treesize reduction 100, result has 67.2 percent of original size [2019-09-20 13:02:30,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:30,684 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 91 [2019-09-20 13:02:30,685 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,731 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:276, output treesize:231 [2019-09-20 13:02:30,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:30,842 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 82 [2019-09-20 13:02:30,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,911 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_69|], 5=[|v_#memory_$Pointer$.offset_86|], 11=[|v_#memory_$Pointer$.base_86|]} [2019-09-20 13:02:30,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:30,919 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 0 case distinctions, treesize of input 35 treesize of output 34 [2019-09-20 13:02:30,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:31,052 INFO L341 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2019-09-20 13:02:31,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 158 [2019-09-20 13:02:31,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,055 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-20 13:02:31,164 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-20 13:02:31,164 INFO L567 ElimStorePlain]: treesize reduction 20, result has 91.4 percent of original size [2019-09-20 13:02:31,290 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-20 13:02:31,291 INFO L341 Elim1Store]: treesize reduction 64, result has 57.3 percent of original size [2019-09-20 13:02:31,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 141 [2019-09-20 13:02:31,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,303 INFO L496 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:31,425 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-20 13:02:31,425 INFO L567 ElimStorePlain]: treesize reduction 62, result has 59.5 percent of original size [2019-09-20 13:02:31,426 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-20 13:02:31,426 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:277, output treesize:146 [2019-09-20 13:02:31,502 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.offset_87|], 6=[|v_#memory_int_70|], 11=[|v_#memory_$Pointer$.base_87|]} [2019-09-20 13:02:31,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:31,543 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 406 treesize of output 361 [2019-09-20 13:02:31,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:31,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-20 13:02:31,747 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-20 13:02:31,748 INFO L567 ElimStorePlain]: treesize reduction 898, result has 32.7 percent of original size [2019-09-20 13:02:31,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:31,754 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 380 treesize of output 301 [2019-09-20 13:02:31,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,902 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 336 treesize of output 233 [2019-09-20 13:02:31,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:31,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:31,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:31,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:31,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,913 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:32,095 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-20 13:02:32,095 INFO L567 ElimStorePlain]: treesize reduction 2187, result has 12.9 percent of original size [2019-09-20 13:02:32,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:32,097 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:461, output treesize:374 [2019-09-20 13:02:32,215 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_80|, |v_#memory_$Pointer$.base_80|], 5=[|v_#memory_$Pointer$.offset_88|], 10=[|v_#memory_int_71|], 19=[|v_#memory_$Pointer$.base_88|]} [2019-09-20 13:02:32,219 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-20 13:02:32,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:32,310 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-20 13:02:32,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:32,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:32,504 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-20 13:02:32,504 INFO L341 Elim1Store]: treesize reduction 82, result has 57.7 percent of original size [2019-09-20 13:02:32,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 562 treesize of output 509 [2019-09-20 13:02:32,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:32,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:32,507 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:32,673 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-20 13:02:32,673 INFO L567 ElimStorePlain]: treesize reduction 100, result has 85.6 percent of original size [2019-09-20 13:02:32,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:32,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 94 [2019-09-20 13:02:32,680 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:32,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:33,164 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2019-09-20 13:02:33,164 INFO L341 Elim1Store]: treesize reduction 126, result has 67.4 percent of original size [2019-09-20 13:02:33,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 512 treesize of output 367 [2019-09-20 13:02:33,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:33,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:33,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:33,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:33,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:33,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:33,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:33,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:33,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:33,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:33,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:33,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:33,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:33,190 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 5 xjuncts. [2019-09-20 13:02:33,605 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2019-09-20 13:02:33,606 INFO L567 ElimStorePlain]: treesize reduction 7463, result has 6.5 percent of original size [2019-09-20 13:02:33,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:33,607 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:785, output treesize:452 [2019-09-20 13:02:33,810 INFO L392 ElimStorePlain]: Different costs {11=[|#memory_$Pointer$.offset|], 29=[|#memory_$Pointer$.base|]} [2019-09-20 13:02:33,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:33,852 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:33,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 455 treesize of output 389 [2019-09-20 13:02:33,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:34,012 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-20 13:02:34,012 INFO L567 ElimStorePlain]: treesize reduction 38, result has 89.4 percent of original size [2019-09-20 13:02:34,110 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:34,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 320 treesize of output 216 [2019-09-20 13:02:34,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,187 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:34,271 INFO L567 ElimStorePlain]: treesize reduction 136, result has 31.3 percent of original size [2019-09-20 13:02:34,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:34,272 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:483, output treesize:34 [2019-09-20 13:02:34,324 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 29 treesize of output 13 [2019-09-20 13:02:34,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:34,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:34,331 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-20 13:02:34,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2019-09-20 13:02:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:02:34,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:34,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2019-09-20 13:02:34,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-20 13:02:34,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-20 13:02:34,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2019-09-20 13:02:34,352 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 25 states. [2019-09-20 13:02:34,816 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-20 13:02:34,994 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-20 13:02:35,272 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-20 13:02:35,541 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 88 [2019-09-20 13:02:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:36,284 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-09-20 13:02:36,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-20 13:02:36,284 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 36 [2019-09-20 13:02:36,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:36,285 INFO L225 Difference]: With dead ends: 73 [2019-09-20 13:02:36,286 INFO L226 Difference]: Without dead ends: 71 [2019-09-20 13:02:36,287 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2019-09-20 13:02:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-20 13:02:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2019-09-20 13:02:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-20 13:02:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-20 13:02:36,297 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 36 [2019-09-20 13:02:36,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:36,298 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-20 13:02:36,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-20 13:02:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-20 13:02:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-20 13:02:36,298 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:36,299 INFO L407 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:36,299 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:36,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:36,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1004692923, now seen corresponding path program 9 times [2019-09-20 13:02:36,299 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:36,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:36,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:36,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:02:36,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat