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_search_value-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:10:34,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:10:34,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:10:34,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:10:34,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:10:34,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:10:34,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:10:34,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:10:34,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:10:34,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:10:34,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:10:34,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:10:34,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:10:34,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:10:34,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:10:34,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:10:34,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:10:34,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:10:34,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:10:34,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:10:34,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:10:34,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:10:34,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:10:34,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:10:34,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:10:34,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:10:34,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:10:34,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:10:34,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:10:34,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:10:34,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:10:34,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:10:34,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:10:34,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:10:34,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:10:34,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:10:34,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:10:34,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:10:34,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:10:34,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:10:34,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:10:34,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:10:34,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:10:34,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:10:34,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:10:34,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:10:34,268 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:10:34,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:10:34,269 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:10:34,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:10:34,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:10:34,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:10:34,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:10:34,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:10:34,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:10:34,271 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:10:34,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:10:34,272 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:10:34,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:10:34,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:10:34,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:10:34,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:10:34,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:10:34,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:10:34,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:10:34,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:10:34,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:10:34,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:10:34,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:10:34,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:10:34,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:10:34,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:10:34,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:10:34,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:10:34,586 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:10:34,587 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:10:34,588 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2019-10-14 23:10:34,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/736a0136b/be16356d8d624777b56bb72ab01cdd23/FLAG3e4256dde [2019-10-14 23:10:35,185 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:10:35,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2019-10-14 23:10:35,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/736a0136b/be16356d8d624777b56bb72ab01cdd23/FLAG3e4256dde [2019-10-14 23:10:35,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/736a0136b/be16356d8d624777b56bb72ab01cdd23 [2019-10-14 23:10:35,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:10:35,514 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:10:35,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:35,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:10:35,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:10:35,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:35" (1/1) ... [2019-10-14 23:10:35,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62309fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:35, skipping insertion in model container [2019-10-14 23:10:35,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:35" (1/1) ... [2019-10-14 23:10:35,528 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:10:35,572 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:10:35,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:35,977 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:10:36,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:36,081 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:10:36,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:36 WrapperNode [2019-10-14 23:10:36,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:36,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:10:36,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:10:36,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:10:36,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:36" (1/1) ... [2019-10-14 23:10:36,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:36" (1/1) ... [2019-10-14 23:10:36,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:36" (1/1) ... [2019-10-14 23:10:36,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:36" (1/1) ... [2019-10-14 23:10:36,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:36" (1/1) ... [2019-10-14 23:10:36,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:36" (1/1) ... [2019-10-14 23:10:36,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:36" (1/1) ... [2019-10-14 23:10:36,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:10:36,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:10:36,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:10:36,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:10:36,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:10:36,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:10:36,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:10:36,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:10:36,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:10:36,216 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-14 23:10:36,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:10:36,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:10:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:10:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:10:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:10:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:10:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:10:36,218 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:10:36,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:10:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:10:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:10:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:10:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:10:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:10:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:10:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:10:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:10:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:10:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:10:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:10:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:10:36,224 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:10:36,224 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:10:36,224 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:10:36,225 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:10:36,225 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:10:36,225 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:10:36,225 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:10:36,225 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:10:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:10:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:10:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:10:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:10:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:10:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:10:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:10:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:10:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:10:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:10:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:10:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:10:36,228 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:10:36,228 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:10:36,228 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:10:36,228 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:10:36,228 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:10:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:10:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:10:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:10:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:10:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:10:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:10:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:10:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:10:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:10:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:10:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:10:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:10:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:10:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 23:10:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:10:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:10:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:10:36,232 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 23:10:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:10:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:10:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 23:10:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:10:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:10:36,234 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 23:10:36,234 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:10:36,235 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:10:36,235 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:10:36,235 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:10:36,235 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:10:36,235 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:10:36,236 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:10:36,236 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:10:36,236 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:10:36,236 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:10:36,237 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:10:36,237 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:10:36,238 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:10:36,238 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:10:36,238 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:10:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:10:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:10:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:10:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:10:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:10:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:10:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:10:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:10:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:10:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:10:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:10:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:10:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:10:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:10:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:10:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:10:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:10:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:10:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:10:36,242 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:10:36,242 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:10:36,242 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:10:36,242 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:10:36,242 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-14 23:10:36,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:10:36,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:10:36,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:10:36,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:10:36,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:10:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:10:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:10:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:10:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:10:36,611 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-14 23:10:36,775 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:10:36,775 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 23:10:36,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:36 BoogieIcfgContainer [2019-10-14 23:10:36,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:10:36,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:10:36,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:10:36,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:10:36,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:10:35" (1/3) ... [2019-10-14 23:10:36,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a2d4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:36, skipping insertion in model container [2019-10-14 23:10:36,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:36" (2/3) ... [2019-10-14 23:10:36,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a2d4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:36, skipping insertion in model container [2019-10-14 23:10:36,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:36" (3/3) ... [2019-10-14 23:10:36,786 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2019-10-14 23:10:36,796 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:10:36,804 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:10:36,816 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:10:36,842 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:10:36,842 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:10:36,842 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:10:36,843 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:10:36,843 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:10:36,843 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:10:36,843 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:10:36,844 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:10:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-14 23:10:36,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-14 23:10:36,869 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:36,870 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:36,872 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:36,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:36,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2052998842, now seen corresponding path program 1 times [2019-10-14 23:10:36,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:36,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19387590] [2019-10-14 23:10:36,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:36,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:36,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:37,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19387590] [2019-10-14 23:10:37,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:37,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:10:37,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908747148] [2019-10-14 23:10:37,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:10:37,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:37,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:10:37,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:10:37,074 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-10-14 23:10:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:37,210 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2019-10-14 23:10:37,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:10:37,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-14 23:10:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:37,223 INFO L225 Difference]: With dead ends: 45 [2019-10-14 23:10:37,223 INFO L226 Difference]: Without dead ends: 22 [2019-10-14 23:10:37,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:10:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-14 23:10:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-14 23:10:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-14 23:10:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-14 23:10:37,281 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2019-10-14 23:10:37,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:37,281 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-14 23:10:37,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:10:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-14 23:10:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:10:37,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:37,284 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:37,284 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash 702499287, now seen corresponding path program 1 times [2019-10-14 23:10:37,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:37,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925451120] [2019-10-14 23:10:37,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:37,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925451120] [2019-10-14 23:10:37,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:37,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:10:37,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018224302] [2019-10-14 23:10:37,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:10:37,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:37,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:10:37,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:10:37,397 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 4 states. [2019-10-14 23:10:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:37,470 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-10-14 23:10:37,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:10:37,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-14 23:10:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:37,472 INFO L225 Difference]: With dead ends: 32 [2019-10-14 23:10:37,472 INFO L226 Difference]: Without dead ends: 23 [2019-10-14 23:10:37,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:10:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-14 23:10:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-14 23:10:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-14 23:10:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-10-14 23:10:37,479 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2019-10-14 23:10:37,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:37,480 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-14 23:10:37,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:10:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-10-14 23:10:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:10:37,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:37,481 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:37,481 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:37,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:37,482 INFO L82 PathProgramCache]: Analyzing trace with hash 759757589, now seen corresponding path program 1 times [2019-10-14 23:10:37,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:37,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747174380] [2019-10-14 23:10:37,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:37,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747174380] [2019-10-14 23:10:37,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:37,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:10:37,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955711330] [2019-10-14 23:10:37,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:10:37,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:37,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:10:37,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:10:37,557 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2019-10-14 23:10:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:37,636 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-10-14 23:10:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:10:37,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-14 23:10:37,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:37,638 INFO L225 Difference]: With dead ends: 43 [2019-10-14 23:10:37,638 INFO L226 Difference]: Without dead ends: 28 [2019-10-14 23:10:37,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:10:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-14 23:10:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-10-14 23:10:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-14 23:10:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-14 23:10:37,644 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-10-14 23:10:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:37,644 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-14 23:10:37,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:10:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-14 23:10:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:10:37,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:37,646 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:37,646 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:37,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:37,647 INFO L82 PathProgramCache]: Analyzing trace with hash 299645265, now seen corresponding path program 1 times [2019-10-14 23:10:37,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:37,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147914910] [2019-10-14 23:10:37,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 23:10:37,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147914910] [2019-10-14 23:10:37,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:37,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:10:37,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957588178] [2019-10-14 23:10:37,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:10:37,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:37,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:10:37,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:10:37,747 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 5 states. [2019-10-14 23:10:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:37,824 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-10-14 23:10:37,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:10:37,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-14 23:10:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:37,825 INFO L225 Difference]: With dead ends: 36 [2019-10-14 23:10:37,825 INFO L226 Difference]: Without dead ends: 33 [2019-10-14 23:10:37,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:10:37,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-14 23:10:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-10-14 23:10:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-14 23:10:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-14 23:10:37,831 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-10-14 23:10:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:37,832 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-14 23:10:37,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:10:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-14 23:10:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:10:37,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:37,833 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:37,833 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:37,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:37,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1130545059, now seen corresponding path program 1 times [2019-10-14 23:10:37,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:37,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991048283] [2019-10-14 23:10:37,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 23:10:37,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991048283] [2019-10-14 23:10:37,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:37,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:10:37,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786238409] [2019-10-14 23:10:37,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:10:37,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:37,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:10:37,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:10:37,945 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 6 states. [2019-10-14 23:10:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:38,035 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-14 23:10:38,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:10:38,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-14 23:10:38,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:38,036 INFO L225 Difference]: With dead ends: 37 [2019-10-14 23:10:38,036 INFO L226 Difference]: Without dead ends: 29 [2019-10-14 23:10:38,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:10:38,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-14 23:10:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-14 23:10:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-14 23:10:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-14 23:10:38,042 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2019-10-14 23:10:38,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:38,043 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-14 23:10:38,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:10:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-14 23:10:38,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:10:38,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:38,044 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:38,044 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:38,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:38,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1128698017, now seen corresponding path program 1 times [2019-10-14 23:10:38,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:38,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485025348] [2019-10-14 23:10:38,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:38,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:38,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:38,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485025348] [2019-10-14 23:10:38,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838651863] [2019-10-14 23:10:38,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:10:38,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:38,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:38,277 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:38,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-14 23:10:38,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930972095] [2019-10-14 23:10:38,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:10:38,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:38,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:10:38,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:10:38,279 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2019-10-14 23:10:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:38,378 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-10-14 23:10:38,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:10:38,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-10-14 23:10:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:38,380 INFO L225 Difference]: With dead ends: 54 [2019-10-14 23:10:38,380 INFO L226 Difference]: Without dead ends: 36 [2019-10-14 23:10:38,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:10:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-14 23:10:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-10-14 23:10:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:10:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-14 23:10:38,387 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2019-10-14 23:10:38,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:38,387 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-14 23:10:38,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:10:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-14 23:10:38,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:10:38,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:38,388 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:38,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:38,594 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:38,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1905192293, now seen corresponding path program 2 times [2019-10-14 23:10:38,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:38,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074791750] [2019-10-14 23:10:38,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:38,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:38,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:38,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074791750] [2019-10-14 23:10:38,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937202259] [2019-10-14 23:10:38,706 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:38,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:10:38,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:38,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:10:38,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:38,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:38,890 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:38,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-10-14 23:10:38,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879976649] [2019-10-14 23:10:38,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:10:38,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:38,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:10:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:10:38,892 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-14 23:10:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:39,016 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-10-14 23:10:39,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:10:39,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-10-14 23:10:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:39,018 INFO L225 Difference]: With dead ends: 59 [2019-10-14 23:10:39,018 INFO L226 Difference]: Without dead ends: 41 [2019-10-14 23:10:39,019 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:10:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-14 23:10:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-10-14 23:10:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 23:10:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-14 23:10:39,028 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-10-14 23:10:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:39,028 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-14 23:10:39,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:10:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-14 23:10:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:10:39,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:39,030 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:39,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:39,235 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:39,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:39,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1016458017, now seen corresponding path program 3 times [2019-10-14 23:10:39,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:39,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563744080] [2019-10-14 23:10:39,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:39,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:39,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:39,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563744080] [2019-10-14 23:10:39,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347471385] [2019-10-14 23:10:39,347 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:39,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 23:10:39,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:39,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 23:10:39,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:39,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:39,513 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:39,514 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:39,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-10-14 23:10:39,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15814472] [2019-10-14 23:10:39,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:10:39,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:39,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:10:39,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:10:39,517 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2019-10-14 23:10:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:39,641 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-10-14 23:10:39,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:10:39,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-10-14 23:10:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:39,643 INFO L225 Difference]: With dead ends: 64 [2019-10-14 23:10:39,643 INFO L226 Difference]: Without dead ends: 46 [2019-10-14 23:10:39,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:10:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-14 23:10:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-10-14 23:10:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-14 23:10:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-14 23:10:39,649 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2019-10-14 23:10:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:39,650 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-14 23:10:39,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:10:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-14 23:10:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 23:10:39,651 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:39,651 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:39,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:39,856 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:39,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:39,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1614029541, now seen corresponding path program 4 times [2019-10-14 23:10:39,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:39,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353600765] [2019-10-14 23:10:39,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:39,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:39,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:39,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353600765] [2019-10-14 23:10:39,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596510207] [2019-10-14 23:10:39,997 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:40,128 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 23:10:40,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:40,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-14 23:10:40,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:40,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:40,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:40,280 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:40,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,316 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-14 23:10:40,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-14 23:10:40,392 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 13 treesize of output 9 [2019-10-14 23:10:40,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:49 [2019-10-14 23:10:40,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 99 [2019-10-14 23:10:40,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,546 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.3 percent of original size [2019-10-14 23:10:40,577 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-10-14 23:10:40,577 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 66 treesize of output 40 [2019-10-14 23:10:40,578 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,615 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-10-14 23:10:40,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,615 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:44 [2019-10-14 23:10:40,695 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,696 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 82 treesize of output 82 [2019-10-14 23:10:40,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:40,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,751 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-10-14 23:10:40,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:40,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:110 [2019-10-14 23:10:40,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 189 [2019-10-14 23:10:40,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,028 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-14 23:10:41,029 INFO L567 ElimStorePlain]: treesize reduction 96, result has 62.5 percent of original size [2019-10-14 23:10:41,090 INFO L341 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-10-14 23:10:41,090 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 143 treesize of output 95 [2019-10-14 23:10:41,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,100 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:41,183 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.0 percent of original size [2019-10-14 23:10:41,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:41,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:97 [2019-10-14 23:10:41,290 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,291 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 171 treesize of output 161 [2019-10-14 23:10:41,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:41,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:41,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-10-14 23:10:41,411 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-10-14 23:10:41,411 INFO L567 ElimStorePlain]: treesize reduction 1061, result has 14.0 percent of original size [2019-10-14 23:10:41,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:41,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:188, output treesize:223 [2019-10-14 23:10:41,500 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 84 [2019-10-14 23:10:41,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,680 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-10-14 23:10:41,680 INFO L341 Elim1Store]: treesize reduction 72, result has 59.6 percent of original size [2019-10-14 23:10:41,681 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 227 treesize of output 155 [2019-10-14 23:10:41,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,707 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:41,793 INFO L567 ElimStorePlain]: treesize reduction 78, result has 49.0 percent of original size [2019-10-14 23:10:41,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:41,795 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:243, output treesize:147 [2019-10-14 23:10:41,966 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-14 23:10:41,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,967 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 245 [2019-10-14 23:10:41,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:41,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:41,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:41,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:41,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:41,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:41,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-10-14 23:10:42,261 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-10-14 23:10:42,262 INFO L567 ElimStorePlain]: treesize reduction 3660, result has 6.5 percent of original size [2019-10-14 23:10:42,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:42,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:274, output treesize:321 [2019-10-14 23:10:42,337 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_12|], 20=[|v_#memory_$Pointer$.base_20|]} [2019-10-14 23:10:42,342 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:42,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,785 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-10-14 23:10:42,785 INFO L341 Elim1Store]: treesize reduction 138, result has 68.2 percent of original size [2019-10-14 23:10:42,786 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 8 new quantified variables, introduced 11 case distinctions, treesize of input 317 treesize of output 361 [2019-10-14 23:10:42,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:42,889 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 18 xjuncts. [2019-10-14 23:10:43,660 WARN L191 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-10-14 23:10:43,661 INFO L567 ElimStorePlain]: treesize reduction 29410, result has 1.1 percent of original size [2019-10-14 23:10:43,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:43,663 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:398, output treesize:291 [2019-10-14 23:10:43,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,822 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 295 treesize of output 215 [2019-10-14 23:10:43,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,866 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:43,930 INFO L567 ElimStorePlain]: treesize reduction 152, result has 22.8 percent of original size [2019-10-14 23:10:43,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:295, output treesize:4 [2019-10-14 23:10:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:43,970 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:43,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 22 [2019-10-14 23:10:43,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963707510] [2019-10-14 23:10:43,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 23:10:43,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:43,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 23:10:43,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:10:43,972 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 22 states. [2019-10-14 23:10:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:45,201 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-10-14 23:10:45,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-14 23:10:45,202 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-10-14 23:10:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:45,204 INFO L225 Difference]: With dead ends: 75 [2019-10-14 23:10:45,204 INFO L226 Difference]: Without dead ends: 57 [2019-10-14 23:10:45,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=201, Invalid=1205, Unknown=0, NotChecked=0, Total=1406 [2019-10-14 23:10:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-14 23:10:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-10-14 23:10:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-14 23:10:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-14 23:10:45,212 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 40 [2019-10-14 23:10:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:45,212 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-14 23:10:45,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 23:10:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-14 23:10:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-14 23:10:45,214 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:45,214 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:45,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:45,419 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:45,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash 128571999, now seen corresponding path program 5 times [2019-10-14 23:10:45,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:45,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681239008] [2019-10-14 23:10:45,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:45,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:45,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:45,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681239008] [2019-10-14 23:10:45,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067549224] [2019-10-14 23:10:45,555 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:45,803 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-14 23:10:45,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:45,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-14 23:10:45,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:45,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:45,825 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:45,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-10-14 23:10:45,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515602159] [2019-10-14 23:10:45,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:10:45,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:45,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:10:45,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:10:45,834 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 11 states. [2019-10-14 23:10:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:45,996 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-10-14 23:10:45,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 23:10:45,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-10-14 23:10:45,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:45,998 INFO L225 Difference]: With dead ends: 74 [2019-10-14 23:10:45,998 INFO L226 Difference]: Without dead ends: 56 [2019-10-14 23:10:45,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:10:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-14 23:10:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-10-14 23:10:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 23:10:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-10-14 23:10:46,011 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 45 [2019-10-14 23:10:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:46,039 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-10-14 23:10:46,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:10:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-10-14 23:10:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 23:10:46,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:46,040 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:46,247 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:46,248 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:46,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:46,249 INFO L82 PathProgramCache]: Analyzing trace with hash 806061979, now seen corresponding path program 6 times [2019-10-14 23:10:46,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:46,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426934500] [2019-10-14 23:10:46,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:46,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:46,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:46,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426934500] [2019-10-14 23:10:46,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084153481] [2019-10-14 23:10:46,379 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:47,362 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-14 23:10:47,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:47,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-14 23:10:47,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:47,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:47,402 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:47,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2019-10-14 23:10:47,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926548034] [2019-10-14 23:10:47,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:10:47,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:47,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:10:47,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:10:47,404 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 12 states. [2019-10-14 23:10:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:47,603 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-10-14 23:10:47,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 23:10:47,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-10-14 23:10:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:47,606 INFO L225 Difference]: With dead ends: 79 [2019-10-14 23:10:47,606 INFO L226 Difference]: Without dead ends: 61 [2019-10-14 23:10:47,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:10:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-14 23:10:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-10-14 23:10:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 23:10:47,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-10-14 23:10:47,613 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 50 [2019-10-14 23:10:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:47,614 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-10-14 23:10:47,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:10:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-10-14 23:10:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-14 23:10:47,615 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:47,615 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:47,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:47,822 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:47,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:47,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1190084641, now seen corresponding path program 7 times [2019-10-14 23:10:47,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:47,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74284994] [2019-10-14 23:10:47,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:47,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:47,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:47,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74284994] [2019-10-14 23:10:47,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480571634] [2019-10-14 23:10:47,939 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:48,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-14 23:10:48,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:48,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:48,078 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:48,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-10-14 23:10:48,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44455313] [2019-10-14 23:10:48,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 23:10:48,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:48,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 23:10:48,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:10:48,080 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 13 states. [2019-10-14 23:10:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:48,273 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-10-14 23:10:48,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:10:48,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-10-14 23:10:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:48,275 INFO L225 Difference]: With dead ends: 84 [2019-10-14 23:10:48,276 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 23:10:48,276 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:10:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 23:10:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-10-14 23:10:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-14 23:10:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-14 23:10:48,282 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 55 [2019-10-14 23:10:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:48,282 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-14 23:10:48,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 23:10:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-14 23:10:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:10:48,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:48,284 INFO L380 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:48,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:48,488 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:48,488 INFO L82 PathProgramCache]: Analyzing trace with hash 244847131, now seen corresponding path program 8 times [2019-10-14 23:10:48,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:48,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605646443] [2019-10-14 23:10:48,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:48,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:48,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:48,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605646443] [2019-10-14 23:10:48,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790148429] [2019-10-14 23:10:48,638 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:48,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:10:48,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:48,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 23:10:48,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:48,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:48,816 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:48,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-10-14 23:10:48,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282286955] [2019-10-14 23:10:48,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:10:48,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:48,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:10:48,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:10:48,818 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 14 states. [2019-10-14 23:10:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:49,035 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-10-14 23:10:49,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 23:10:49,036 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-14 23:10:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:49,036 INFO L225 Difference]: With dead ends: 89 [2019-10-14 23:10:49,036 INFO L226 Difference]: Without dead ends: 71 [2019-10-14 23:10:49,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=327, Unknown=0, NotChecked=0, Total=506 [2019-10-14 23:10:49,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-14 23:10:49,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-10-14 23:10:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-14 23:10:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-14 23:10:49,043 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 60 [2019-10-14 23:10:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:49,044 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-14 23:10:49,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:10:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-14 23:10:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-14 23:10:49,045 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:49,045 INFO L380 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:49,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:49,254 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:49,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:49,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1765197151, now seen corresponding path program 9 times [2019-10-14 23:10:49,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:49,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386104696] [2019-10-14 23:10:49,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:49,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:49,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:49,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386104696] [2019-10-14 23:10:49,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720040869] [2019-10-14 23:10:49,404 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:52,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-14 23:10:52,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:52,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-14 23:10:52,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:52,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:52,099 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:52,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2019-10-14 23:10:52,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171993570] [2019-10-14 23:10:52,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 23:10:52,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:52,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 23:10:52,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:10:52,101 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 15 states. [2019-10-14 23:10:52,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:52,391 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-10-14 23:10:52,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 23:10:52,392 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-10-14 23:10:52,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:52,393 INFO L225 Difference]: With dead ends: 94 [2019-10-14 23:10:52,393 INFO L226 Difference]: Without dead ends: 76 [2019-10-14 23:10:52,394 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=387, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:10:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-14 23:10:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-10-14 23:10:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-14 23:10:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-14 23:10:52,405 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 65 [2019-10-14 23:10:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:52,405 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-14 23:10:52,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 23:10:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-14 23:10:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-14 23:10:52,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:52,409 INFO L380 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:52,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:52,622 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:52,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:52,623 INFO L82 PathProgramCache]: Analyzing trace with hash -388399973, now seen corresponding path program 10 times [2019-10-14 23:10:52,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:52,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134498441] [2019-10-14 23:10:52,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:52,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:52,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-14 23:10:53,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134498441] [2019-10-14 23:10:53,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564760819] [2019-10-14 23:10:53,429 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:53,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 23:10:53,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:53,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 122 conjunts are in the unsatisfiable core [2019-10-14 23:10:53,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:53,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 9 [2019-10-14 23:10:53,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2019-10-14 23:10:53,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:53,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,999 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-10-14 23:10:54,007 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-10-14 23:10:54,007 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,032 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-10-14 23:10:54,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:54,092 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-10-14 23:10:54,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-14 23:10:54,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,203 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-10-14 23:10:54,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,282 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-10-14 23:10:54,289 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 19 treesize of output 18 [2019-10-14 23:10:54,290 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,319 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2019-10-14 23:10:54,389 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 11 [2019-10-14 23:10:54,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:54,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:38 [2019-10-14 23:10:54,558 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,559 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 27 treesize of output 99 [2019-10-14 23:10:54,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,685 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-10-14 23:10:54,686 INFO L567 ElimStorePlain]: treesize reduction 42, result has 61.1 percent of original size [2019-10-14 23:10:54,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:54,695 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:54,740 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:55 [2019-10-14 23:10:54,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:54,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:54,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:55 [2019-10-14 23:10:55,050 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 129 [2019-10-14 23:10:55,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,195 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-10-14 23:10:55,195 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.8 percent of original size [2019-10-14 23:10:55,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 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-10-14 23:10:55,205 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:55,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:76 [2019-10-14 23:10:55,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 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-10-14 23:10:55,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:55,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:95, output treesize:76 [2019-10-14 23:10:55,534 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 159 [2019-10-14 23:10:55,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,708 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-10-14 23:10:55,709 INFO L567 ElimStorePlain]: treesize reduction 70, result has 61.5 percent of original size [2019-10-14 23:10:55,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 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-10-14 23:10:55,715 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:55,779 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:98, output treesize:101 [2019-10-14 23:10:55,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 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-10-14 23:10:55,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:55,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:120, output treesize:101 [2019-10-14 23:10:56,221 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-14 23:10:56,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 189 [2019-10-14 23:10:56,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,502 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-10-14 23:10:56,503 INFO L567 ElimStorePlain]: treesize reduction 84, result has 62.7 percent of original size [2019-10-14 23:10:56,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 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-10-14 23:10:56,513 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,622 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-14 23:10:56,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:56,625 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:130 [2019-10-14 23:10:56,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 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-10-14 23:10:56,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,920 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-14 23:10:56,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:56,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:149, output treesize:130 [2019-10-14 23:10:57,711 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-10-14 23:10:57,711 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 47 treesize of output 219 [2019-10-14 23:10:57,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,044 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-10-14 23:10:58,044 INFO L567 ElimStorePlain]: treesize reduction 98, result has 64.0 percent of original size [2019-10-14 23:10:58,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 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-10-14 23:10:58,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,180 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-10-14 23:10:58,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:58,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:58,183 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:152, output treesize:163 [2019-10-14 23:11:00,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 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-10-14 23:11:00,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,788 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-14 23:11:00,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:00,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:182, output treesize:163 [2019-10-14 23:11:06,058 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-10-14 23:11:06,058 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:06,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 52 treesize of output 249 [2019-10-14 23:11:06,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,585 WARN L191 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2019-10-14 23:11:06,586 INFO L567 ElimStorePlain]: treesize reduction 112, result has 65.3 percent of original size [2019-10-14 23:11:06,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 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-10-14 23:11:06,597 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,791 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-10-14 23:11:06,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:06,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:06,794 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:185, output treesize:200 [2019-10-14 23:11:12,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 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-10-14 23:11:12,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:12,300 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-10-14 23:11:12,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:12,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:12,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:219, output treesize:200