/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 19:23:38,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 19:23:38,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 19:23:38,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 19:23:38,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 19:23:38,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 19:23:38,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 19:23:38,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 19:23:38,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 19:23:38,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 19:23:38,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 19:23:38,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 19:23:38,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 19:23:38,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 19:23:38,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 19:23:38,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 19:23:38,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 19:23:38,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 19:23:38,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 19:23:38,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 19:23:38,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 19:23:38,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 19:23:38,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 19:23:38,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 19:23:38,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 19:23:38,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 19:23:38,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 19:23:38,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 19:23:38,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 19:23:38,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 19:23:38,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 19:23:38,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 19:23:38,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 19:23:38,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 19:23:38,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 19:23:38,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 19:23:38,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 19:23:38,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 19:23:38,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 19:23:38,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 19:23:38,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 19:23:38,283 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-11-06 19:23:38,304 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 19:23:38,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 19:23:38,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 19:23:38,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 19:23:38,306 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 19:23:38,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 19:23:38,306 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 19:23:38,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 19:23:38,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 19:23:38,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 19:23:38,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 19:23:38,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 19:23:38,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 19:23:38,308 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 19:23:38,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 19:23:38,308 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 19:23:38,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 19:23:38,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 19:23:38,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 19:23:38,309 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 19:23:38,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 19:23:38,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:23:38,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 19:23:38,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 19:23:38,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 19:23:38,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 19:23:38,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 19:23:38,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 19:23:38,311 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 19:23:38,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 19:23:38,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 19:23:38,608 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 19:23:38,610 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 19:23:38,610 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 19:23:38,611 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple.i [2019-11-06 19:23:38,684 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362d3a331/d8cdc6f1f61f411283e5e28b7d2007b5/FLAG912c81685 [2019-11-06 19:23:39,185 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 19:23:39,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i [2019-11-06 19:23:39,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362d3a331/d8cdc6f1f61f411283e5e28b7d2007b5/FLAG912c81685 [2019-11-06 19:23:39,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362d3a331/d8cdc6f1f61f411283e5e28b7d2007b5 [2019-11-06 19:23:39,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 19:23:39,522 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 19:23:39,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 19:23:39,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 19:23:39,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 19:23:39,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:39" (1/1) ... [2019-11-06 19:23:39,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160dde8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:39, skipping insertion in model container [2019-11-06 19:23:39,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:39" (1/1) ... [2019-11-06 19:23:39,538 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 19:23:39,588 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 19:23:40,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:23:40,061 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 19:23:40,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:23:40,159 INFO L192 MainTranslator]: Completed translation [2019-11-06 19:23:40,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:40 WrapperNode [2019-11-06 19:23:40,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 19:23:40,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 19:23:40,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 19:23:40,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 19:23:40,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:40" (1/1) ... [2019-11-06 19:23:40,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:40" (1/1) ... [2019-11-06 19:23:40,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:40" (1/1) ... [2019-11-06 19:23:40,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:40" (1/1) ... [2019-11-06 19:23:40,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:40" (1/1) ... [2019-11-06 19:23:40,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:40" (1/1) ... [2019-11-06 19:23:40,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:40" (1/1) ... [2019-11-06 19:23:40,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 19:23:40,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 19:23:40,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 19:23:40,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 19:23:40,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:40" (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-11-06 19:23:40,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 19:23:40,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 19:23:40,293 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 19:23:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 19:23:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 19:23:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 19:23:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 19:23:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 19:23:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 19:23:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 19:23:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 19:23:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 19:23:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 19:23:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 19:23:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 19:23:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 19:23:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 19:23:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 19:23:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 19:23:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 19:23:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 19:23:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 19:23:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 19:23:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 19:23:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 19:23:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 19:23:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 19:23:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 19:23:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 19:23:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 19:23:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 19:23:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 19:23:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 19:23:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 19:23:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 19:23:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 19:23:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 19:23:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 19:23:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 19:23:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 19:23:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 19:23:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 19:23:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 19:23:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 19:23:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 19:23:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 19:23:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 19:23:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 19:23:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 19:23:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 19:23:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 19:23:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 19:23:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 19:23:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 19:23:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 19:23:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 19:23:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 19:23:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 19:23:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 19:23:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 19:23:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 19:23:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 19:23:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 19:23:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 19:23:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 19:23:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 19:23:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 19:23:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 19:23:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 19:23:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 19:23:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 19:23:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 19:23:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 19:23:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 19:23:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 19:23:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 19:23:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 19:23:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 19:23:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 19:23:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 19:23:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 19:23:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 19:23:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 19:23:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 19:23:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 19:23:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 19:23:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 19:23:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 19:23:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 19:23:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 19:23:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 19:23:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 19:23:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 19:23:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 19:23:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 19:23:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 19:23:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 19:23:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 19:23:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 19:23:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 19:23:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 19:23:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 19:23:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 19:23:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 19:23:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 19:23:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 19:23:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 19:23:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 19:23:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 19:23:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 19:23:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 19:23:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 19:23:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 19:23:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 19:23:40,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 19:23:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 19:23:40,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 19:23:40,934 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 19:23:40,934 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-06 19:23:40,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:40 BoogieIcfgContainer [2019-11-06 19:23:40,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 19:23:40,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 19:23:40,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 19:23:40,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 19:23:40,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:23:39" (1/3) ... [2019-11-06 19:23:40,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfadeb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:40, skipping insertion in model container [2019-11-06 19:23:40,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:40" (2/3) ... [2019-11-06 19:23:40,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfadeb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:40, skipping insertion in model container [2019-11-06 19:23:40,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:40" (3/3) ... [2019-11-06 19:23:40,942 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2019-11-06 19:23:40,951 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 19:23:40,959 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-06 19:23:40,970 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-06 19:23:41,000 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 19:23:41,001 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 19:23:41,001 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 19:23:41,001 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 19:23:41,001 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 19:23:41,001 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 19:23:41,001 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 19:23:41,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 19:23:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-06 19:23:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-06 19:23:41,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:41,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:41,029 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:41,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:41,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993325, now seen corresponding path program 1 times [2019-11-06 19:23:41,045 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:41,045 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683788780] [2019-11-06 19:23:41,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:41,243 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683788780] [2019-11-06 19:23:41,243 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:41,244 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 19:23:41,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031529204] [2019-11-06 19:23:41,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 19:23:41,249 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:41,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 19:23:41,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 19:23:41,261 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-11-06 19:23:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:41,422 INFO L93 Difference]: Finished difference Result 76 states and 118 transitions. [2019-11-06 19:23:41,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 19:23:41,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-06 19:23:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:41,434 INFO L225 Difference]: With dead ends: 76 [2019-11-06 19:23:41,434 INFO L226 Difference]: Without dead ends: 35 [2019-11-06 19:23:41,437 INFO L630 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-11-06 19:23:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-06 19:23:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-06 19:23:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-06 19:23:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-11-06 19:23:41,491 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 11 [2019-11-06 19:23:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:41,491 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-06 19:23:41,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 19:23:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2019-11-06 19:23:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 19:23:41,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:41,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:41,493 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:41,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:41,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1902233848, now seen corresponding path program 1 times [2019-11-06 19:23:41,493 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:41,494 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625047338] [2019-11-06 19:23:41,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:41,628 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625047338] [2019-11-06 19:23:41,629 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:41,629 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:23:41,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704175914] [2019-11-06 19:23:41,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:23:41,631 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:41,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:23:41,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:41,632 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 6 states. [2019-11-06 19:23:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:41,920 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-11-06 19:23:41,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:23:41,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-06 19:23:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:41,922 INFO L225 Difference]: With dead ends: 75 [2019-11-06 19:23:41,922 INFO L226 Difference]: Without dead ends: 49 [2019-11-06 19:23:41,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:23:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-06 19:23:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-11-06 19:23:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-06 19:23:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-11-06 19:23:41,932 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 14 [2019-11-06 19:23:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:41,932 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-06 19:23:41,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:23:41,932 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-11-06 19:23:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 19:23:41,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:41,933 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:41,934 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:41,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:41,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1902292180, now seen corresponding path program 1 times [2019-11-06 19:23:41,934 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:41,934 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770609092] [2019-11-06 19:23:41,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:42,049 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770609092] [2019-11-06 19:23:42,049 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:42,049 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 19:23:42,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983402594] [2019-11-06 19:23:42,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 19:23:42,050 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:42,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 19:23:42,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:23:42,051 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2019-11-06 19:23:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:42,198 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-11-06 19:23:42,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 19:23:42,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-06 19:23:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:42,200 INFO L225 Difference]: With dead ends: 68 [2019-11-06 19:23:42,200 INFO L226 Difference]: Without dead ends: 54 [2019-11-06 19:23:42,201 INFO L630 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-11-06 19:23:42,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-06 19:23:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2019-11-06 19:23:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-06 19:23:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2019-11-06 19:23:42,217 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 14 [2019-11-06 19:23:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:42,217 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2019-11-06 19:23:42,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 19:23:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2019-11-06 19:23:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 19:23:42,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:42,218 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:42,218 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:42,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:42,220 INFO L82 PathProgramCache]: Analyzing trace with hash -202034517, now seen corresponding path program 1 times [2019-11-06 19:23:42,220 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:42,220 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848951436] [2019-11-06 19:23:42,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 19:23:42,375 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848951436] [2019-11-06 19:23:42,375 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110408605] [2019-11-06 19:23:42,376 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-11-06 19:23:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:42,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-06 19:23:42,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:42,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:42,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-11-06 19:23:42,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:42,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-06 19:23:42,631 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:42,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:42,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-06 19:23:42,652 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:42,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-06 19:23:42,656 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:42,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:42,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 19:23:42,664 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2019-11-06 19:23:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 19:23:42,672 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:42,673 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-06 19:23:42,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970776441] [2019-11-06 19:23:42,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 19:23:42,674 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:42,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 19:23:42,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:23:42,675 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 7 states. [2019-11-06 19:23:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:42,945 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2019-11-06 19:23:42,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 19:23:42,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-06 19:23:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:42,948 INFO L225 Difference]: With dead ends: 54 [2019-11-06 19:23:42,948 INFO L226 Difference]: Without dead ends: 50 [2019-11-06 19:23:42,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:23:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-06 19:23:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2019-11-06 19:23:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 19:23:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-11-06 19:23:42,957 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 22 [2019-11-06 19:23:42,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:42,957 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-11-06 19:23:42,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 19:23:42,957 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-11-06 19:23:42,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 19:23:42,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:42,958 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:43,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:43,168 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:43,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1078104211, now seen corresponding path program 1 times [2019-11-06 19:23:43,169 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:43,169 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262351197] [2019-11-06 19:23:43,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:43,317 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262351197] [2019-11-06 19:23:43,318 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988385180] [2019-11-06 19:23:43,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-11-06 19:23:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:43,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-06 19:23:43,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:43,448 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-11-06 19:23:43,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 19:23:43,489 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 19:23:43,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,518 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 19:23:43,519 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 1 case distinctions, treesize of input 38 treesize of output 15 [2019-11-06 19:23:43,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,529 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-11-06 19:23:43,529 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:28 [2019-11-06 19:23:43,605 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-11-06 19:23:43,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,618 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-11-06 19:23:43,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:9 [2019-11-06 19:23:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:43,645 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:43,645 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-11-06 19:23:43,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501640621] [2019-11-06 19:23:43,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 19:23:43,646 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:43,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 19:23:43,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-06 19:23:43,647 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 11 states. [2019-11-06 19:23:44,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:44,320 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2019-11-06 19:23:44,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 19:23:44,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-11-06 19:23:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:44,322 INFO L225 Difference]: With dead ends: 119 [2019-11-06 19:23:44,322 INFO L226 Difference]: Without dead ends: 109 [2019-11-06 19:23:44,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-11-06 19:23:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-06 19:23:44,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 59. [2019-11-06 19:23:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-06 19:23:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2019-11-06 19:23:44,335 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 24 [2019-11-06 19:23:44,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:44,335 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2019-11-06 19:23:44,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 19:23:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2019-11-06 19:23:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 19:23:44,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:44,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:44,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:44,543 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:44,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:44,543 INFO L82 PathProgramCache]: Analyzing trace with hash -398045841, now seen corresponding path program 1 times [2019-11-06 19:23:44,543 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:44,543 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224655889] [2019-11-06 19:23:44,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:23:44,657 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224655889] [2019-11-06 19:23:44,657 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:44,657 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:23:44,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694874569] [2019-11-06 19:23:44,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:23:44,658 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:44,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:23:44,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:44,659 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand 6 states. [2019-11-06 19:23:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:44,836 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2019-11-06 19:23:44,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 19:23:44,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-06 19:23:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:44,837 INFO L225 Difference]: With dead ends: 79 [2019-11-06 19:23:44,837 INFO L226 Difference]: Without dead ends: 66 [2019-11-06 19:23:44,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:23:44,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-06 19:23:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-11-06 19:23:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-06 19:23:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-11-06 19:23:44,854 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 24 [2019-11-06 19:23:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:44,855 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-11-06 19:23:44,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:23:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-11-06 19:23:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 19:23:44,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:44,859 INFO L410 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-11-06 19:23:44,859 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:44,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1761635681, now seen corresponding path program 2 times [2019-11-06 19:23:44,860 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:44,860 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764018031] [2019-11-06 19:23:44,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:45,151 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764018031] [2019-11-06 19:23:45,151 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869735833] [2019-11-06 19:23:45,152 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 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-11-06 19:23:45,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 19:23:45,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:45,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-06 19:23:45,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:45,317 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-11-06 19:23:45,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 19:23:45,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:45,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-06 19:23:45,377 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 19:23:45,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,413 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_28|], 2=[|v_#memory_int_28|, |v_#memory_int_29|, |v_#memory_int_31|]} [2019-11-06 19:23:45,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:45,423 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 38 treesize of output 15 [2019-11-06 19:23:45,424 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,455 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:45,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,487 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:45,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:45,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:45,512 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 42 treesize of output 36 [2019-11-06 19:23:45,512 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:45,531 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:104, output treesize:45 [2019-11-06 19:23:45,608 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_29|], 4=[|v_#memory_int_32|]} [2019-11-06 19:23:45,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2019-11-06 19:23:45,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,649 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.5 percent of original size [2019-11-06 19:23:45,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-06 19:23:45,653 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:45,662 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:24 [2019-11-06 19:23:45,697 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.base_30|], 6=[|v_#memory_int_33|]} [2019-11-06 19:23:45,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 19:23:45,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 19:23:45,719 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,749 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-06 19:23:45,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2019-11-06 19:23:45,751 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,767 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:58, output treesize:27 [2019-11-06 19:23:45,815 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 2=[|#memory_int|]} [2019-11-06 19:23:45,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2019-11-06 19:23:45,818 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:45,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-06 19:23:45,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 19:23:45,841 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:45,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,849 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:44, output treesize:3 [2019-11-06 19:23:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:45,852 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:45,853 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2019-11-06 19:23:45,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419701931] [2019-11-06 19:23:45,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-06 19:23:45,854 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:45,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-06 19:23:45,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:23:45,854 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 17 states. [2019-11-06 19:23:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:46,363 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2019-11-06 19:23:46,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 19:23:46,364 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-11-06 19:23:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:46,365 INFO L225 Difference]: With dead ends: 101 [2019-11-06 19:23:46,365 INFO L226 Difference]: Without dead ends: 99 [2019-11-06 19:23:46,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-11-06 19:23:46,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-06 19:23:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 72. [2019-11-06 19:23:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-06 19:23:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-11-06 19:23:46,377 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 25 [2019-11-06 19:23:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:46,377 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-11-06 19:23:46,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-06 19:23:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-11-06 19:23:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 19:23:46,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:46,379 INFO L410 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-11-06 19:23:46,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:46,584 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:46,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1761633759, now seen corresponding path program 1 times [2019-11-06 19:23:46,585 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:46,586 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387940648] [2019-11-06 19:23:46,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 19:23:46,632 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387940648] [2019-11-06 19:23:46,633 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:46,633 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:23:46,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334965452] [2019-11-06 19:23:46,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:23:46,634 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:46,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:23:46,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:46,634 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 4 states. [2019-11-06 19:23:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:46,721 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2019-11-06 19:23:46,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:23:46,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-06 19:23:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:46,723 INFO L225 Difference]: With dead ends: 80 [2019-11-06 19:23:46,723 INFO L226 Difference]: Without dead ends: 78 [2019-11-06 19:23:46,723 INFO L630 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-11-06 19:23:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-06 19:23:46,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2019-11-06 19:23:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-06 19:23:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-11-06 19:23:46,733 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 25 [2019-11-06 19:23:46,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:46,733 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-11-06 19:23:46,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:23:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-11-06 19:23:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 19:23:46,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:46,735 INFO L410 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:46,735 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1476274771, now seen corresponding path program 3 times [2019-11-06 19:23:46,736 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:46,736 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550522831] [2019-11-06 19:23:46,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:46,904 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550522831] [2019-11-06 19:23:46,904 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547146452] [2019-11-06 19:23:46,904 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 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-11-06 19:23:47,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 19:23:47,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:47,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-06 19:23:47,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:47,146 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-11-06 19:23:47,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:47,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 19:23:47,234 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:47,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 19:23:47,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:47,272 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 34 treesize of output 15 [2019-11-06 19:23:47,273 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:47,301 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 34 treesize of output 15 [2019-11-06 19:23:47,302 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:47,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,315 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:41 [2019-11-06 19:23:47,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2019-11-06 19:23:47,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:47,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:47,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 59 [2019-11-06 19:23:47,420 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,450 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2019-11-06 19:23:47,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,451 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:18 [2019-11-06 19:23:47,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 19:23:47,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:47,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 19:23:47,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:47,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,496 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-06 19:23:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:47,499 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:47,499 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-11-06 19:23:47,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161608281] [2019-11-06 19:23:47,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 19:23:47,501 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:47,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 19:23:47,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-06 19:23:47,503 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 14 states. [2019-11-06 19:23:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:48,283 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2019-11-06 19:23:48,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 19:23:48,284 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-11-06 19:23:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:48,285 INFO L225 Difference]: With dead ends: 128 [2019-11-06 19:23:48,285 INFO L226 Difference]: Without dead ends: 94 [2019-11-06 19:23:48,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2019-11-06 19:23:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-06 19:23:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2019-11-06 19:23:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-06 19:23:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-11-06 19:23:48,296 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 26 [2019-11-06 19:23:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:48,297 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-11-06 19:23:48,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 19:23:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-11-06 19:23:48,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 19:23:48,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:48,298 INFO L410 BasicCegarLoop]: trace histogram [2, 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-11-06 19:23:48,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:48,504 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:48,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:48,504 INFO L82 PathProgramCache]: Analyzing trace with hash 118595862, now seen corresponding path program 1 times [2019-11-06 19:23:48,505 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:48,505 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385519283] [2019-11-06 19:23:48,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:48,850 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385519283] [2019-11-06 19:23:48,851 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508510419] [2019-11-06 19:23:48,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-11-06 19:23:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:48,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-06 19:23:48,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:48,974 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-11-06 19:23:48,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:48,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:48,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:48,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:23:48,997 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:48,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 19:23:48,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,020 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 19:23:49,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2019-11-06 19:23:49,021 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,029 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-11-06 19:23:49,029 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:23 [2019-11-06 19:23:49,096 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_34|], 6=[|v_#memory_$Pointer$.base_35|]} [2019-11-06 19:23:49,101 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 13 treesize of output 9 [2019-11-06 19:23:49,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:49,157 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-06 19:23:49,158 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 2 case distinctions, treesize of input 39 treesize of output 47 [2019-11-06 19:23:49,159 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,192 INFO L567 ElimStorePlain]: treesize reduction 34, result has 52.8 percent of original size [2019-11-06 19:23:49,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:49,193 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:38 [2019-11-06 19:23:49,234 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_30|], 2=[|v_#memory_int_35|], 6=[|v_#memory_$Pointer$.base_36|]} [2019-11-06 19:23:49,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2019-11-06 19:23:49,239 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:49,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-11-06 19:23:49,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,330 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 121 [2019-11-06 19:23:49,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,334 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,373 INFO L567 ElimStorePlain]: treesize reduction 80, result has 38.9 percent of original size [2019-11-06 19:23:49,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:49,376 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:96, output treesize:51 [2019-11-06 19:23:49,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,490 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_37|], 6=[|v_#memory_int_36|]} [2019-11-06 19:23:49,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2019-11-06 19:23:49,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-06 19:23:49,517 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:49,528 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:24 [2019-11-06 19:23:49,571 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_31|], 6=[|v_#memory_int_37|]} [2019-11-06 19:23:49,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 19:23:49,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 19:23:49,626 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,661 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-06 19:23:49,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2019-11-06 19:23:49,662 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,683 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:58, output treesize:27 [2019-11-06 19:23:49,748 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 2=[|#memory_int|]} [2019-11-06 19:23:49,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2019-11-06 19:23:49,751 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:49,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-06 19:23:49,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 19:23:49,770 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,774 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:44, output treesize:3 [2019-11-06 19:23:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:49,778 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:49,778 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-11-06 19:23:49,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112483783] [2019-11-06 19:23:49,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 19:23:49,779 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:49,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 19:23:49,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-11-06 19:23:49,779 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 21 states. [2019-11-06 19:23:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:50,644 INFO L93 Difference]: Finished difference Result 131 states and 158 transitions. [2019-11-06 19:23:50,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-06 19:23:50,645 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-11-06 19:23:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:50,646 INFO L225 Difference]: With dead ends: 131 [2019-11-06 19:23:50,646 INFO L226 Difference]: Without dead ends: 129 [2019-11-06 19:23:50,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2019-11-06 19:23:50,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-06 19:23:50,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 88. [2019-11-06 19:23:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-06 19:23:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2019-11-06 19:23:50,656 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 27 [2019-11-06 19:23:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:50,657 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2019-11-06 19:23:50,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 19:23:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2019-11-06 19:23:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 19:23:50,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:50,658 INFO L410 BasicCegarLoop]: trace histogram [3, 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-11-06 19:23:50,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:50,863 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:50,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:50,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1811002181, now seen corresponding path program 2 times [2019-11-06 19:23:50,864 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:50,864 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634436699] [2019-11-06 19:23:50,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:51,188 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634436699] [2019-11-06 19:23:51,188 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919896734] [2019-11-06 19:23:51,189 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 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-11-06 19:23:51,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 19:23:51,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:51,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-06 19:23:51,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:51,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-11-06 19:23:51,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:51,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:51,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:51,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:51,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:51,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:51,445 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:23 [2019-11-06 19:23:51,478 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_32|], 2=[|v_#memory_int_39|, |v_#memory_$Pointer$.base_40|]} [2019-11-06 19:23:51,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2019-11-06 19:23:51,482 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:51,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:51,523 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:51,524 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 31 treesize of output 68 [2019-11-06 19:23:51,525 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:51,569 INFO L567 ElimStorePlain]: treesize reduction 26, result has 74.8 percent of original size [2019-11-06 19:23:51,591 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:51,592 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 70 treesize of output 90 [2019-11-06 19:23:51,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:51,594 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-06 19:23:51,655 INFO L567 ElimStorePlain]: treesize reduction 60, result has 54.5 percent of original size [2019-11-06 19:23:51,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:51,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:51,657 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2019-11-06 19:23:51,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:51,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:51,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:51,800 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_41|], 15=[|v_#memory_int_40|]} [2019-11-06 19:23:51,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:51,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2019-11-06 19:23:51,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:51,813 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:51,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2019-11-06 19:23:51,814 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:51,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-11-06 19:23:51,823 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:51,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:51,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2019-11-06 19:23:51,877 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:51,884 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 33 treesize of output 21 [2019-11-06 19:23:51,885 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:51,936 INFO L341 Elim1Store]: treesize reduction 24, result has 58.6 percent of original size [2019-11-06 19:23:51,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 54 [2019-11-06 19:23:51,938 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:51,976 INFO L567 ElimStorePlain]: treesize reduction 52, result has 39.5 percent of original size [2019-11-06 19:23:51,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 19:23:51,977 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:143, output treesize:34 [2019-11-06 19:23:52,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 19:23:52,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:52,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:52,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:52,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-11-06 19:23:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 19:23:52,093 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:52,093 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-11-06 19:23:52,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557785641] [2019-11-06 19:23:52,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 19:23:52,094 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:52,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 19:23:52,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2019-11-06 19:23:52,095 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 24 states. [2019-11-06 19:23:52,858 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-11-06 19:23:53,331 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-11-06 19:23:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:54,331 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2019-11-06 19:23:54,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-06 19:23:54,331 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-11-06 19:23:54,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:54,332 INFO L225 Difference]: With dead ends: 109 [2019-11-06 19:23:54,333 INFO L226 Difference]: Without dead ends: 98 [2019-11-06 19:23:54,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2019-11-06 19:23:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-06 19:23:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-11-06 19:23:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-06 19:23:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2019-11-06 19:23:54,343 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 28 [2019-11-06 19:23:54,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:54,344 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2019-11-06 19:23:54,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 19:23:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2019-11-06 19:23:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 19:23:54,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:54,345 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:54,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:54,549 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:54,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1416587397, now seen corresponding path program 3 times [2019-11-06 19:23:54,550 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:54,550 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574885175] [2019-11-06 19:23:54,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:55,394 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574885175] [2019-11-06 19:23:55,394 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323276214] [2019-11-06 19:23:55,394 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 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-11-06 19:23:55,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 19:23:55,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:55,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 89 conjunts are in the unsatisfiable core [2019-11-06 19:23:55,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:55,597 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-11-06 19:23:55,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:55,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:55,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:55,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:23:55,636 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:55,636 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-11-06 19:23:55,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:55,695 INFO L567 ElimStorePlain]: treesize reduction 14, result has 87.4 percent of original size [2019-11-06 19:23:55,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:55,704 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 38 treesize of output 15 [2019-11-06 19:23:55,704 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:55,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:55,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:55,733 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 38 treesize of output 15 [2019-11-06 19:23:55,733 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:55,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:55,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:55,752 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:99, output treesize:49 [2019-11-06 19:23:55,838 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:55,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-06 19:23:55,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:55,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:55,901 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 10=[|v_#memory_$Pointer$.offset_34|, |v_#memory_$Pointer$.base_43|]} [2019-11-06 19:23:55,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 19:23:55,909 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:55,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:55,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 32 [2019-11-06 19:23:55,967 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:55,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:56,028 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:56,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 83 [2019-11-06 19:23:56,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:56,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:56,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:56,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:56,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:56,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:56,034 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,128 INFO L567 ElimStorePlain]: treesize reduction 219, result has 23.4 percent of original size [2019-11-06 19:23:56,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,129 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:171, output treesize:95 [2019-11-06 19:23:56,251 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_42|], 11=[|v_#memory_$Pointer$.offset_35|, |v_#memory_$Pointer$.base_44|]} [2019-11-06 19:23:56,259 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 29 treesize of output 28 [2019-11-06 19:23:56,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,371 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-06 19:23:56,371 INFO L567 ElimStorePlain]: treesize reduction 12, result has 92.6 percent of original size [2019-11-06 19:23:56,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-11-06 19:23:56,386 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:56,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,437 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:56,438 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 3 case distinctions, treesize of input 92 treesize of output 80 [2019-11-06 19:23:56,439 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,492 INFO L567 ElimStorePlain]: treesize reduction 96, result has 53.8 percent of original size [2019-11-06 19:23:56,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,493 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:166, output treesize:112 [2019-11-06 19:23:56,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:56,568 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_43|], 11=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_36|]} [2019-11-06 19:23:56,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-11-06 19:23:56,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,652 INFO L567 ElimStorePlain]: treesize reduction 16, result has 91.8 percent of original size [2019-11-06 19:23:56,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,670 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:56,670 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 3 case distinctions, treesize of input 160 treesize of output 143 [2019-11-06 19:23:56,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,737 INFO L567 ElimStorePlain]: treesize reduction 96, result has 59.3 percent of original size [2019-11-06 19:23:56,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,755 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:56,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 112 [2019-11-06 19:23:56,757 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:56,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,778 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:203, output treesize:95 [2019-11-06 19:23:56,911 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_44|], 6=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_37|]} [2019-11-06 19:23:56,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2019-11-06 19:23:56,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,036 INFO L341 Elim1Store]: treesize reduction 8, result has 88.7 percent of original size [2019-11-06 19:23:57,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 114 [2019-11-06 19:23:57,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,049 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:57,131 INFO L567 ElimStorePlain]: treesize reduction 48, result has 64.2 percent of original size [2019-11-06 19:23:57,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:57,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:57,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:57,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-11-06 19:23:57,141 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:57,168 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:141, output treesize:62 [2019-11-06 19:23:57,217 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_38|], 3=[|v_#memory_int_45|]} [2019-11-06 19:23:57,223 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32 [2019-11-06 19:23:57,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,264 INFO L567 ElimStorePlain]: treesize reduction 8, result has 88.6 percent of original size [2019-11-06 19:23:57,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:57,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 19:23:57,269 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,315 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2019-11-06 19:23:57,316 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,336 INFO L567 ElimStorePlain]: treesize reduction 48, result has 37.7 percent of original size [2019-11-06 19:23:57,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:57,337 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:88, output treesize:29 [2019-11-06 19:23:57,405 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2019-11-06 19:23:57,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,426 INFO L567 ElimStorePlain]: treesize reduction 40, result has 42.0 percent of original size [2019-11-06 19:23:57,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:57,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2019-11-06 19:23:57,495 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2019-11-06 19:23:57,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-06 19:23:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:57,513 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:57,513 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 25 [2019-11-06 19:23:57,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616778056] [2019-11-06 19:23:57,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-06 19:23:57,514 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:57,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-06 19:23:57,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2019-11-06 19:23:57,515 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand 25 states. [2019-11-06 19:23:57,976 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-06 19:24:00,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:00,476 INFO L93 Difference]: Finished difference Result 173 states and 212 transitions. [2019-11-06 19:24:00,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-06 19:24:00,477 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2019-11-06 19:24:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:00,479 INFO L225 Difference]: With dead ends: 173 [2019-11-06 19:24:00,479 INFO L226 Difference]: Without dead ends: 163 [2019-11-06 19:24:00,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2019-11-06 19:24:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-06 19:24:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 107. [2019-11-06 19:24:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-06 19:24:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 133 transitions. [2019-11-06 19:24:00,509 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 133 transitions. Word has length 30 [2019-11-06 19:24:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:00,510 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 133 transitions. [2019-11-06 19:24:00,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-06 19:24:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2019-11-06 19:24:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 19:24:00,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:00,511 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:24:00,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:00,713 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:00,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash 630287441, now seen corresponding path program 4 times [2019-11-06 19:24:00,714 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:00,714 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589560827] [2019-11-06 19:24:00,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:01,027 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-11-06 19:24:01,156 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-06 19:24:01,324 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-11-06 19:24:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:01,528 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589560827] [2019-11-06 19:24:01,528 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255856297] [2019-11-06 19:24:01,529 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 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-11-06 19:24:01,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 19:24:01,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:24:01,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 87 conjunts are in the unsatisfiable core [2019-11-06 19:24:01,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:24:01,662 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-11-06 19:24:01,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:01,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:01,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:01,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:24:01,699 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:01,699 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-11-06 19:24:01,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:01,774 INFO L567 ElimStorePlain]: treesize reduction 14, result has 87.4 percent of original size [2019-11-06 19:24:01,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:01,782 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 38 treesize of output 15 [2019-11-06 19:24:01,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:01,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:01,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:01,808 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 38 treesize of output 15 [2019-11-06 19:24:01,808 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:01,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:01,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:01,829 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:99, output treesize:49 [2019-11-06 19:24:01,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:01,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-06 19:24:01,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:01,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,018 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 163 treesize of output 137 [2019-11-06 19:24:02,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,024 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,130 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-11-06 19:24:02,130 INFO L567 ElimStorePlain]: treesize reduction 165, result has 41.9 percent of original size [2019-11-06 19:24:02,164 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 102 [2019-11-06 19:24:02,165 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,204 INFO L567 ElimStorePlain]: treesize reduction 32, result has 64.8 percent of original size [2019-11-06 19:24:02,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,205 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:184, output treesize:80 [2019-11-06 19:24:02,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:02,305 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,306 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 3 case distinctions, treesize of input 89 treesize of output 77 [2019-11-06 19:24:02,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,362 INFO L567 ElimStorePlain]: treesize reduction 96, result has 52.2 percent of original size [2019-11-06 19:24:02,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:02,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:02,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-11-06 19:24:02,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,393 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:86 [2019-11-06 19:24:02,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:02,421 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,422 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 3 case distinctions, treesize of input 148 treesize of output 127 [2019-11-06 19:24:02,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,469 INFO L567 ElimStorePlain]: treesize reduction 72, result has 62.3 percent of original size [2019-11-06 19:24:02,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:02,490 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 99 [2019-11-06 19:24:02,491 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,503 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:158, output treesize:80 [2019-11-06 19:24:02,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:02,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-06 19:24:02,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,665 INFO L341 Elim1Store]: treesize reduction 8, result has 88.7 percent of original size [2019-11-06 19:24:02,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 104 [2019-11-06 19:24:02,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,675 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:02,729 INFO L567 ElimStorePlain]: treesize reduction 44, result has 56.9 percent of original size [2019-11-06 19:24:02,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:113, output treesize:41 [2019-11-06 19:24:02,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2019-11-06 19:24:02,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 59 [2019-11-06 19:24:02,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,826 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2019-11-06 19:24:02,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,828 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:18 [2019-11-06 19:24:02,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 19:24:02,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 19:24:02,867 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,871 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-06 19:24:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:02,899 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:24:02,900 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2019-11-06 19:24:02,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419096678] [2019-11-06 19:24:02,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 19:24:02,900 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:02,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 19:24:02,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2019-11-06 19:24:02,901 INFO L87 Difference]: Start difference. First operand 107 states and 133 transitions. Second operand 21 states. [2019-11-06 19:24:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:04,652 INFO L93 Difference]: Finished difference Result 178 states and 221 transitions. [2019-11-06 19:24:04,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-06 19:24:04,652 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-11-06 19:24:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:04,654 INFO L225 Difference]: With dead ends: 178 [2019-11-06 19:24:04,654 INFO L226 Difference]: Without dead ends: 144 [2019-11-06 19:24:04,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2019-11-06 19:24:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-06 19:24:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 126. [2019-11-06 19:24:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-06 19:24:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2019-11-06 19:24:04,667 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 31 [2019-11-06 19:24:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:04,667 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2019-11-06 19:24:04,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 19:24:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2019-11-06 19:24:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 19:24:04,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:04,668 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:24:04,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:04,875 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:04,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash 722984259, now seen corresponding path program 1 times [2019-11-06 19:24:04,876 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:04,876 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356710031] [2019-11-06 19:24:04,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:05,037 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356710031] [2019-11-06 19:24:05,038 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914439624] [2019-11-06 19:24:05,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-11-06 19:24:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:05,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-06 19:24:05,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:24:05,193 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-11-06 19:24:05,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 19:24:05,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 19:24:05,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,227 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 19:24:05,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2019-11-06 19:24:05,228 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,234 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-11-06 19:24:05,234 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2019-11-06 19:24:05,278 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_46|], 6=[|v_#memory_$Pointer$.base_56|]} [2019-11-06 19:24:05,288 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-11-06 19:24:05,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,320 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 64 [2019-11-06 19:24:05,321 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,347 INFO L567 ElimStorePlain]: treesize reduction 36, result has 41.9 percent of original size [2019-11-06 19:24:05,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:05,348 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:26 [2019-11-06 19:24:05,375 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_47|], 6=[|v_#memory_$Pointer$.base_57|]} [2019-11-06 19:24:05,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 19:24:05,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,412 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 44 [2019-11-06 19:24:05,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,446 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.6 percent of original size [2019-11-06 19:24:05,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,448 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:39 [2019-11-06 19:24:05,540 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2019-11-06 19:24:05,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:05,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:05,543 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:05,559 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-06 19:24:05,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-11-06 19:24:05,564 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,571 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-11-06 19:24:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:05,576 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:24:05,576 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2019-11-06 19:24:05,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304533294] [2019-11-06 19:24:05,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 19:24:05,577 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:05,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 19:24:05,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-06 19:24:05,578 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand 18 states. [2019-11-06 19:24:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:06,816 INFO L93 Difference]: Finished difference Result 201 states and 244 transitions. [2019-11-06 19:24:06,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-06 19:24:06,817 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-11-06 19:24:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:06,819 INFO L225 Difference]: With dead ends: 201 [2019-11-06 19:24:06,819 INFO L226 Difference]: Without dead ends: 187 [2019-11-06 19:24:06,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=1514, Unknown=0, NotChecked=0, Total=1722 [2019-11-06 19:24:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-06 19:24:06,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 138. [2019-11-06 19:24:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-06 19:24:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2019-11-06 19:24:06,833 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 32 [2019-11-06 19:24:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:06,833 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2019-11-06 19:24:06,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 19:24:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2019-11-06 19:24:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 19:24:06,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:06,834 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:24:07,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:07,039 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:07,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:07,039 INFO L82 PathProgramCache]: Analyzing trace with hash 780242561, now seen corresponding path program 1 times [2019-11-06 19:24:07,040 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:07,040 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795079226] [2019-11-06 19:24:07,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 19:24:07,095 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795079226] [2019-11-06 19:24:07,095 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:24:07,095 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 19:24:07,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163056203] [2019-11-06 19:24:07,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 19:24:07,096 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:07,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 19:24:07,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:24:07,096 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand 7 states. [2019-11-06 19:24:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:07,225 INFO L93 Difference]: Finished difference Result 169 states and 206 transitions. [2019-11-06 19:24:07,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:24:07,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-11-06 19:24:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:07,226 INFO L225 Difference]: With dead ends: 169 [2019-11-06 19:24:07,226 INFO L226 Difference]: Without dead ends: 147 [2019-11-06 19:24:07,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:24:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-06 19:24:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2019-11-06 19:24:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-06 19:24:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 167 transitions. [2019-11-06 19:24:07,240 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 167 transitions. Word has length 32 [2019-11-06 19:24:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:07,241 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 167 transitions. [2019-11-06 19:24:07,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 19:24:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 167 transitions. [2019-11-06 19:24:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 19:24:07,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:07,243 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:24:07,243 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:07,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:07,244 INFO L82 PathProgramCache]: Analyzing trace with hash 387215551, now seen corresponding path program 1 times [2019-11-06 19:24:07,244 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:07,244 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383092581] [2019-11-06 19:24:07,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:24:07,466 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383092581] [2019-11-06 19:24:07,467 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107635938] [2019-11-06 19:24:07,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-11-06 19:24:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:07,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-06 19:24:07,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:24:07,610 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-11-06 19:24:07,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:07,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:07,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:07,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 19:24:07,621 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 13 treesize of output 9 [2019-11-06 19:24:07,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:07,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:07,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:07,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-06 19:24:07,675 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:07,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 19:24:07,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:07,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:07,708 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_58|], 2=[|v_#memory_int_50|, |v_#memory_int_48|, |v_#memory_int_47|]} [2019-11-06 19:24:07,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:07,715 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 38 treesize of output 15 [2019-11-06 19:24:07,716 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:07,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:07,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:07,749 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 25 treesize of output 13 [2019-11-06 19:24:07,750 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:07,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:07,773 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:07,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:07,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:07,798 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 26 treesize of output 29 [2019-11-06 19:24:07,798 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:07,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:07,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:07,813 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:104, output treesize:45 [2019-11-06 19:24:07,873 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_59|], 4=[|v_#memory_int_51|]} [2019-11-06 19:24:07,881 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:07,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2019-11-06 19:24:07,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:07,904 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.5 percent of original size [2019-11-06 19:24:07,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-06 19:24:07,908 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:07,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:07,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:07,916 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:24 [2019-11-06 19:24:07,948 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_60|], 6=[|v_#memory_int_52|]} [2019-11-06 19:24:07,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 19:24:07,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:07,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:07,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 19:24:07,971 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:07,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:08,001 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-06 19:24:08,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2019-11-06 19:24:08,002 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:08,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:08,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:08,015 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:58, output treesize:27 [2019-11-06 19:24:08,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:24:08,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:08,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:08,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 19:24:08,098 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:08,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:08,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:08,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-06 19:24:08,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 19:24:08,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:08,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:08,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:08,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-06 19:24:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:08,156 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:24:08,157 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2019-11-06 19:24:08,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192133841] [2019-11-06 19:24:08,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 19:24:08,158 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:08,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 19:24:08,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-11-06 19:24:08,159 INFO L87 Difference]: Start difference. First operand 137 states and 167 transitions. Second operand 19 states. [2019-11-06 19:24:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:09,056 INFO L93 Difference]: Finished difference Result 174 states and 207 transitions. [2019-11-06 19:24:09,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 19:24:09,057 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-11-06 19:24:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:09,058 INFO L225 Difference]: With dead ends: 174 [2019-11-06 19:24:09,058 INFO L226 Difference]: Without dead ends: 138 [2019-11-06 19:24:09,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-11-06 19:24:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-06 19:24:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129. [2019-11-06 19:24:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-06 19:24:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 155 transitions. [2019-11-06 19:24:09,072 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 155 transitions. Word has length 32 [2019-11-06 19:24:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:09,072 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 155 transitions. [2019-11-06 19:24:09,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-06 19:24:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 155 transitions. [2019-11-06 19:24:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 19:24:09,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:09,073 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:24:09,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:09,278 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:09,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1945173470, now seen corresponding path program 1 times [2019-11-06 19:24:09,279 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:09,279 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280197676] [2019-11-06 19:24:09,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 19:24:09,339 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280197676] [2019-11-06 19:24:09,339 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:24:09,339 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:24:09,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279492241] [2019-11-06 19:24:09,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:24:09,340 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:09,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:24:09,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:24:09,340 INFO L87 Difference]: Start difference. First operand 129 states and 155 transitions. Second operand 6 states. [2019-11-06 19:24:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:09,450 INFO L93 Difference]: Finished difference Result 172 states and 204 transitions. [2019-11-06 19:24:09,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 19:24:09,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-06 19:24:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:09,451 INFO L225 Difference]: With dead ends: 172 [2019-11-06 19:24:09,451 INFO L226 Difference]: Without dead ends: 155 [2019-11-06 19:24:09,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:24:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-06 19:24:09,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 143. [2019-11-06 19:24:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-06 19:24:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 169 transitions. [2019-11-06 19:24:09,463 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 169 transitions. Word has length 32 [2019-11-06 19:24:09,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:09,464 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 169 transitions. [2019-11-06 19:24:09,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:24:09,464 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 169 transitions. [2019-11-06 19:24:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 19:24:09,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:09,465 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:24:09,465 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:09,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1265115100, now seen corresponding path program 1 times [2019-11-06 19:24:09,466 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:09,466 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466129998] [2019-11-06 19:24:09,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:24:09,603 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466129998] [2019-11-06 19:24:09,603 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880810891] [2019-11-06 19:24:09,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:09,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-06 19:24:09,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:24:09,732 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-11-06 19:24:09,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:09,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:09,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:09,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 19:24:09,758 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:09,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 19:24:09,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:09,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:09,777 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 34 treesize of output 15 [2019-11-06 19:24:09,777 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:09,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:09,794 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 34 treesize of output 15 [2019-11-06 19:24:09,794 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:09,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:09,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:09,805 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:79, output treesize:38 [2019-11-06 19:24:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:24:09,921 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:24:09,921 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-06 19:24:09,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830141656] [2019-11-06 19:24:09,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 19:24:09,922 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 19:24:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-06 19:24:09,922 INFO L87 Difference]: Start difference. First operand 143 states and 169 transitions. Second operand 12 states. [2019-11-06 19:24:10,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:10,470 INFO L93 Difference]: Finished difference Result 163 states and 192 transitions. [2019-11-06 19:24:10,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 19:24:10,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-11-06 19:24:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:10,472 INFO L225 Difference]: With dead ends: 163 [2019-11-06 19:24:10,472 INFO L226 Difference]: Without dead ends: 140 [2019-11-06 19:24:10,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:24:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-06 19:24:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2019-11-06 19:24:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-06 19:24:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 163 transitions. [2019-11-06 19:24:10,483 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 163 transitions. Word has length 32 [2019-11-06 19:24:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:10,483 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 163 transitions. [2019-11-06 19:24:10,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 19:24:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2019-11-06 19:24:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 19:24:10,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:10,485 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:24:10,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:10,689 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:10,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1338676576, now seen corresponding path program 1 times [2019-11-06 19:24:10,690 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:10,690 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869655735] [2019-11-06 19:24:10,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:10,824 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869655735] [2019-11-06 19:24:10,824 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504535774] [2019-11-06 19:24:10,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:10,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-06 19:24:10,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:24:10,951 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-11-06 19:24:10,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:10,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:10,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:10,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 19:24:10,980 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:10,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 19:24:10,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:11,024 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-11-06 19:24:11,038 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 19:24:11,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2019-11-06 19:24:11,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:11,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:11,050 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-11-06 19:24:11,050 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:42 [2019-11-06 19:24:11,213 INFO L341 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2019-11-06 19:24:11,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 69 [2019-11-06 19:24:11,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:11,249 INFO L567 ElimStorePlain]: treesize reduction 22, result has 63.9 percent of original size [2019-11-06 19:24:11,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:11,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:26 [2019-11-06 19:24:11,294 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:11,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-06 19:24:11,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:11,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:11,405 INFO L341 Elim1Store]: treesize reduction 75, result has 45.7 percent of original size [2019-11-06 19:24:11,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 78 [2019-11-06 19:24:11,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:11,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:11,408 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:11,472 INFO L567 ElimStorePlain]: treesize reduction 91, result has 34.5 percent of original size [2019-11-06 19:24:11,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:11,473 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:90, output treesize:47 [2019-11-06 19:24:11,706 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:11,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 65 [2019-11-06 19:24:11,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:11,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:11,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:11,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:11,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:11,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:11,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:11,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:11,725 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:11,806 INFO L567 ElimStorePlain]: treesize reduction 36, result has 32.1 percent of original size [2019-11-06 19:24:11,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:11,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:9 [2019-11-06 19:24:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:11,854 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:24:11,855 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-06 19:24:11,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307396780] [2019-11-06 19:24:11,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-06 19:24:11,856 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:11,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-06 19:24:11,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:24:11,857 INFO L87 Difference]: Start difference. First operand 138 states and 163 transitions. Second operand 17 states. [2019-11-06 19:24:13,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:13,175 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2019-11-06 19:24:13,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 19:24:13,176 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-11-06 19:24:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:13,178 INFO L225 Difference]: With dead ends: 186 [2019-11-06 19:24:13,178 INFO L226 Difference]: Without dead ends: 172 [2019-11-06 19:24:13,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-11-06 19:24:13,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-06 19:24:13,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-11-06 19:24:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-06 19:24:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2019-11-06 19:24:13,199 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 32 [2019-11-06 19:24:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:13,200 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2019-11-06 19:24:13,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-06 19:24:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2019-11-06 19:24:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 19:24:13,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:13,201 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:24:13,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:13,415 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:13,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:13,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2018734946, now seen corresponding path program 1 times [2019-11-06 19:24:13,416 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:13,416 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139548740] [2019-11-06 19:24:13,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 19:24:13,469 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139548740] [2019-11-06 19:24:13,470 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:24:13,470 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:24:13,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538375459] [2019-11-06 19:24:13,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:24:13,471 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:13,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:24:13,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:24:13,471 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand 6 states. [2019-11-06 19:24:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:13,596 INFO L93 Difference]: Finished difference Result 217 states and 253 transitions. [2019-11-06 19:24:13,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 19:24:13,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-06 19:24:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:13,598 INFO L225 Difference]: With dead ends: 217 [2019-11-06 19:24:13,598 INFO L226 Difference]: Without dead ends: 151 [2019-11-06 19:24:13,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:24:13,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-06 19:24:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2019-11-06 19:24:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-06 19:24:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2019-11-06 19:24:13,612 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 32 [2019-11-06 19:24:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:13,613 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2019-11-06 19:24:13,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:24:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2019-11-06 19:24:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 19:24:13,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:13,614 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:24:13,614 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:13,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1093981088, now seen corresponding path program 5 times [2019-11-06 19:24:13,615 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:13,615 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194246425] [2019-11-06 19:24:13,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:13,912 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-11-06 19:24:14,129 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 30 [2019-11-06 19:24:14,548 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-11-06 19:24:15,023 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 40 [2019-11-06 19:24:15,449 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 35 [2019-11-06 19:24:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:15,839 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194246425] [2019-11-06 19:24:15,839 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203735306] [2019-11-06 19:24:15,839 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:16,107 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-06 19:24:16,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:24:16,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 95 conjunts are in the unsatisfiable core [2019-11-06 19:24:16,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:24:16,123 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-11-06 19:24:16,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:16,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:16,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:16,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:24:16,163 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:16,163 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-11-06 19:24:16,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:16,241 INFO L567 ElimStorePlain]: treesize reduction 14, result has 87.4 percent of original size [2019-11-06 19:24:16,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:16,251 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 38 treesize of output 15 [2019-11-06 19:24:16,251 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:16,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:16,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:16,280 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 38 treesize of output 15 [2019-11-06 19:24:16,281 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:16,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:16,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:16,301 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:99, output treesize:49 [2019-11-06 19:24:16,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:16,395 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 26 treesize of output 89 [2019-11-06 19:24:16,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:16,563 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-06 19:24:16,563 INFO L567 ElimStorePlain]: treesize reduction 40, result has 83.8 percent of original size [2019-11-06 19:24:16,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:16,595 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:16,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 146 [2019-11-06 19:24:16,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:16,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:16,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:16,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:16,599 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:16,776 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2019-11-06 19:24:16,776 INFO L567 ElimStorePlain]: treesize reduction 315, result has 31.5 percent of original size [2019-11-06 19:24:16,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:16,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:16,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 111 [2019-11-06 19:24:16,813 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:16,876 INFO L567 ElimStorePlain]: treesize reduction 32, result has 71.7 percent of original size [2019-11-06 19:24:16,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:16,877 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:201, output treesize:81 [2019-11-06 19:24:16,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:16,979 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:16,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-06 19:24:16,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:17,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:17,158 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-11-06 19:24:17,158 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-11-06 19:24:17,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 222 treesize of output 177 [2019-11-06 19:24:17,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,274 INFO L496 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:17,800 WARN L191 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 70 [2019-11-06 19:24:17,800 INFO L567 ElimStorePlain]: treesize reduction 474, result has 27.1 percent of original size