/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-simple-white-blue-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 19:23:39,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 19:23:39,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 19:23:39,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 19:23:39,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 19:23:39,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 19:23:39,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 19:23:39,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 19:23:39,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 19:23:39,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 19:23:39,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 19:23:39,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 19:23:39,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 19:23:39,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 19:23:39,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 19:23:39,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 19:23:39,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 19:23:39,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 19:23:39,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 19:23:39,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 19:23:39,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 19:23:39,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 19:23:39,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 19:23:39,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 19:23:39,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 19:23:39,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 19:23:39,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 19:23:39,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 19:23:39,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 19:23:39,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 19:23:39,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 19:23:39,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 19:23:39,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 19:23:39,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 19:23:39,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 19:23:39,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 19:23:39,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 19:23:39,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 19:23:39,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 19:23:39,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 19:23:39,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 19:23:39,350 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:39,373 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 19:23:39,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 19:23:39,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 19:23:39,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 19:23:39,375 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 19:23:39,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 19:23:39,379 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 19:23:39,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 19:23:39,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 19:23:39,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 19:23:39,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 19:23:39,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 19:23:39,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 19:23:39,380 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 19:23:39,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 19:23:39,381 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 19:23:39,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 19:23:39,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 19:23:39,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 19:23:39,381 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 19:23:39,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 19:23:39,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:23:39,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 19:23:39,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 19:23:39,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 19:23:39,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 19:23:39,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 19:23:39,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 19:23:39,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 19:23:39,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 19:23:39,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 19:23:39,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 19:23:39,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 19:23:39,717 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 19:23:39,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue-1.i [2019-11-06 19:23:39,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb4af22e/afa1395b74b142f087b105d5a06adfb5/FLAG0cb858b58 [2019-11-06 19:23:40,334 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 19:23:40,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-simple-white-blue-1.i [2019-11-06 19:23:40,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb4af22e/afa1395b74b142f087b105d5a06adfb5/FLAG0cb858b58 [2019-11-06 19:23:40,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb4af22e/afa1395b74b142f087b105d5a06adfb5 [2019-11-06 19:23:40,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 19:23:40,630 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 19:23:40,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 19:23:40,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 19:23:40,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 19:23:40,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:40" (1/1) ... [2019-11-06 19:23:40,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510f79ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:40, skipping insertion in model container [2019-11-06 19:23:40,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:40" (1/1) ... [2019-11-06 19:23:40,651 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 19:23:40,706 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 19:23:41,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:23:41,136 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 19:23:41,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:23:41,263 INFO L192 MainTranslator]: Completed translation [2019-11-06 19:23:41,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:41 WrapperNode [2019-11-06 19:23:41,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 19:23:41,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 19:23:41,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 19:23:41,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 19:23:41,279 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:41" (1/1) ... [2019-11-06 19:23:41,280 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:41" (1/1) ... [2019-11-06 19:23:41,296 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:41" (1/1) ... [2019-11-06 19:23:41,296 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:41" (1/1) ... [2019-11-06 19:23:41,313 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:41" (1/1) ... [2019-11-06 19:23:41,319 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:41" (1/1) ... [2019-11-06 19:23:41,322 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:41" (1/1) ... [2019-11-06 19:23:41,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 19:23:41,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 19:23:41,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 19:23:41,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 19:23:41,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:41" (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:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 19:23:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 19:23:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 19:23:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 19:23:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 19:23:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 19:23:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 19:23:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 19:23:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 19:23:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 19:23:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 19:23:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 19:23:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 19:23:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 19:23:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 19:23:41,398 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 19:23:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 19:23:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 19:23:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 19:23:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 19:23:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 19:23:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 19:23:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 19:23:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 19:23:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 19:23:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 19:23:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 19:23:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 19:23:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 19:23:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 19:23:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 19:23:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 19:23:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 19:23:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 19:23:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 19:23:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 19:23:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 19:23:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 19:23:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 19:23:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 19:23:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 19:23:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 19:23:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 19:23:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 19:23:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 19:23:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 19:23:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 19:23:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 19:23:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 19:23:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 19:23:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 19:23:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 19:23:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 19:23:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 19:23:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 19:23:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 19:23:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 19:23:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 19:23:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 19:23:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 19:23:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 19:23:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 19:23:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 19:23:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 19:23:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 19:23:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 19:23:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 19:23:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 19:23:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 19:23:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 19:23:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 19:23:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 19:23:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 19:23:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 19:23:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 19:23:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 19:23:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 19:23:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 19:23:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 19:23:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 19:23:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 19:23:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 19:23:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 19:23:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 19:23:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 19:23:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 19:23:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 19:23:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 19:23:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 19:23:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 19:23:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 19:23:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 19:23:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 19:23:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 19:23:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 19:23:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 19:23:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 19:23:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 19:23:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 19:23:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 19:23:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 19:23:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 19:23:41,412 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 19:23:41,412 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 19:23:41,412 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 19:23:41,412 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 19:23:41,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 19:23:41,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 19:23:41,412 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 19:23:41,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 19:23:41,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 19:23:41,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 19:23:41,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 19:23:41,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 19:23:41,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 19:23:41,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 19:23:41,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 19:23:41,980 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 19:23:41,981 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-06 19:23:41,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:41 BoogieIcfgContainer [2019-11-06 19:23:41,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 19:23:41,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 19:23:41,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 19:23:41,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 19:23:41,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:23:40" (1/3) ... [2019-11-06 19:23:41,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ea1ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:41, skipping insertion in model container [2019-11-06 19:23:41,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:41" (2/3) ... [2019-11-06 19:23:41,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ea1ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:41, skipping insertion in model container [2019-11-06 19:23:41,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:41" (3/3) ... [2019-11-06 19:23:41,991 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2019-11-06 19:23:42,001 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 19:23:42,009 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 19:23:42,021 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 19:23:42,044 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 19:23:42,045 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 19:23:42,045 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 19:23:42,045 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 19:23:42,045 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 19:23:42,045 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 19:23:42,046 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 19:23:42,046 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 19:23:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-11-06 19:23:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 19:23:42,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:42,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:42,070 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:42,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1759752198, now seen corresponding path program 1 times [2019-11-06 19:23:42,083 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:42,083 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295438279] [2019-11-06 19:23:42,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:42,273 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,273 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295438279] [2019-11-06 19:23:42,274 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:42,275 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 19:23:42,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460787229] [2019-11-06 19:23:42,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 19:23:42,281 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:42,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 19:23:42,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 19:23:42,298 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-11-06 19:23:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:42,418 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2019-11-06 19:23:42,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 19:23:42,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-06 19:23:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:42,431 INFO L225 Difference]: With dead ends: 53 [2019-11-06 19:23:42,431 INFO L226 Difference]: Without dead ends: 23 [2019-11-06 19:23:42,435 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:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-06 19:23:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-06 19:23:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-06 19:23:42,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-11-06 19:23:42,474 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2019-11-06 19:23:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:42,475 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-11-06 19:23:42,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 19:23:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-11-06 19:23:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 19:23:42,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:42,476 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:42,476 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:42,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:42,477 INFO L82 PathProgramCache]: Analyzing trace with hash -666433660, now seen corresponding path program 1 times [2019-11-06 19:23:42,477 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:42,477 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707752114] [2019-11-06 19:23:42,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:42,778 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,778 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707752114] [2019-11-06 19:23:42,778 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:42,779 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 19:23:42,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103575347] [2019-11-06 19:23:42,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 19:23:42,785 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:42,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 19:23:42,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:23:42,785 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 8 states. [2019-11-06 19:23:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:43,092 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-11-06 19:23:43,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 19:23:43,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-06 19:23:43,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:43,096 INFO L225 Difference]: With dead ends: 47 [2019-11-06 19:23:43,096 INFO L226 Difference]: Without dead ends: 45 [2019-11-06 19:23:43,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-06 19:23:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-06 19:23:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2019-11-06 19:23:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-06 19:23:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-11-06 19:23:43,106 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 17 [2019-11-06 19:23:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:43,106 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-06 19:23:43,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 19:23:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-11-06 19:23:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 19:23:43,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:43,108 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:43,108 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:43,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1010508073, now seen corresponding path program 1 times [2019-11-06 19:23:43,109 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:43,109 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572996637] [2019-11-06 19:23:43,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 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 [572996637] [2019-11-06 19:23:43,317 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228958888] [2019-11-06 19:23:43,317 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:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:43,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-06 19:23:43,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:43,545 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,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:43,587 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 22 treesize of output 7 [2019-11-06 19:23:43,588 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:43,608 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 22 treesize of output 7 [2019-11-06 19:23:43,609 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,619 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:43,620 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:20 [2019-11-06 19:23:43,648 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,649 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:43,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,689 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:43,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,720 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:43,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:43,757 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 24 treesize of output 27 [2019-11-06 19:23:43,758 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:43,791 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 24 treesize of output 27 [2019-11-06 19:23:43,792 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,815 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:85, output treesize:39 [2019-11-06 19:23:43,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,968 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:23:43,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:43,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:43,976 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:44,001 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-06 19:23:44,006 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:23:44,006 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:44,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:44,016 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:23:44,016 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-11-06 19:23:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:44,020 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:44,020 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-11-06 19:23:44,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037613052] [2019-11-06 19:23:44,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 19:23:44,021 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:44,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 19:23:44,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-06 19:23:44,022 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 11 states. [2019-11-06 19:23:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:44,590 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2019-11-06 19:23:44,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 19:23:44,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-06 19:23:44,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:44,592 INFO L225 Difference]: With dead ends: 74 [2019-11-06 19:23:44,592 INFO L226 Difference]: Without dead ends: 63 [2019-11-06 19:23:44,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-11-06 19:23:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-06 19:23:44,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 38. [2019-11-06 19:23:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 19:23:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-11-06 19:23:44,601 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 19 [2019-11-06 19:23:44,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:44,601 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-11-06 19:23:44,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 19:23:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-11-06 19:23:44,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 19:23:44,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:44,602 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] [2019-11-06 19:23:44,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:44,803 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:44,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:44,804 INFO L82 PathProgramCache]: Analyzing trace with hash -687403823, now seen corresponding path program 1 times [2019-11-06 19:23:44,804 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:44,805 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720951810] [2019-11-06 19:23:44,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:44,953 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720951810] [2019-11-06 19:23:44,953 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:44,953 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 19:23:44,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35758000] [2019-11-06 19:23:44,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 19:23:44,954 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:44,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 19:23:44,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:23:44,955 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 9 states. [2019-11-06 19:23:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:45,261 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2019-11-06 19:23:45,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 19:23:45,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-06 19:23:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:45,265 INFO L225 Difference]: With dead ends: 78 [2019-11-06 19:23:45,265 INFO L226 Difference]: Without dead ends: 63 [2019-11-06 19:23:45,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-06 19:23:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-06 19:23:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-11-06 19:23:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-06 19:23:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-11-06 19:23:45,277 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 20 [2019-11-06 19:23:45,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:45,277 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-11-06 19:23:45,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 19:23:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-11-06 19:23:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 19:23:45,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:45,279 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:45,279 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:45,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:45,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1938777486, now seen corresponding path program 2 times [2019-11-06 19:23:45,279 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:45,279 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119037507] [2019-11-06 19:23:45,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 19:23:45,405 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119037507] [2019-11-06 19:23:45,406 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:45,406 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 19:23:45,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477423048] [2019-11-06 19:23:45,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 19:23:45,407 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:45,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 19:23:45,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:23:45,407 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 7 states. [2019-11-06 19:23:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:45,567 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2019-11-06 19:23:45,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:23:45,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-06 19:23:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:45,568 INFO L225 Difference]: With dead ends: 59 [2019-11-06 19:23:45,568 INFO L226 Difference]: Without dead ends: 46 [2019-11-06 19:23:45,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:23:45,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-06 19:23:45,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2019-11-06 19:23:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-06 19:23:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-11-06 19:23:45,576 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 21 [2019-11-06 19:23:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:45,577 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-06 19:23:45,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 19:23:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-11-06 19:23:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 19:23:45,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:45,578 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] [2019-11-06 19:23:45,578 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:45,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:45,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1961949386, now seen corresponding path program 1 times [2019-11-06 19:23:45,579 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:45,579 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213454762] [2019-11-06 19:23:45,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:45,730 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213454762] [2019-11-06 19:23:45,730 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:45,730 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 19:23:45,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835502154] [2019-11-06 19:23:45,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 19:23:45,731 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:45,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 19:23:45,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:23:45,732 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 8 states. [2019-11-06 19:23:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:45,966 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2019-11-06 19:23:45,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 19:23:45,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-06 19:23:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:45,968 INFO L225 Difference]: With dead ends: 63 [2019-11-06 19:23:45,969 INFO L226 Difference]: Without dead ends: 47 [2019-11-06 19:23:45,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:23:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-06 19:23:45,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-11-06 19:23:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 19:23:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-11-06 19:23:45,976 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2019-11-06 19:23:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:45,977 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-11-06 19:23:45,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 19:23:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-11-06 19:23:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 19:23:45,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:45,978 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] [2019-11-06 19:23:45,978 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:45,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:45,978 INFO L82 PathProgramCache]: Analyzing trace with hash -361877940, now seen corresponding path program 1 times [2019-11-06 19:23:45,978 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:45,979 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614212293] [2019-11-06 19:23:45,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:46,256 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614212293] [2019-11-06 19:23:46,256 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290766267] [2019-11-06 19:23:46,256 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:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:46,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-06 19:23:46,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:46,363 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:46,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:23:46,425 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,425 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:46,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,564 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-06 19:23:46,565 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.6 percent of original size [2019-11-06 19:23:46,573 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:46,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,615 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:46,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,663 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 18 treesize of output 7 [2019-11-06 19:23:46,663 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-11-06 19:23:46,718 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-11-06 19:23:46,749 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,776 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:122, output treesize:66 [2019-11-06 19:23:46,864 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,865 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:46,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,920 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|], 1=[|v_#memory_int_23|, |v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_32|]} [2019-11-06 19:23:46,925 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:46,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,978 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:47,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:47,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-11-06 19:23:47,019 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,076 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.9 percent of original size [2019-11-06 19:23:47,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:47,083 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 33 treesize of output 39 [2019-11-06 19:23:47,084 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:47,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:47,141 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 2 case distinctions, treesize of input 56 treesize of output 77 [2019-11-06 19:23:47,143 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,207 INFO L567 ElimStorePlain]: treesize reduction 48, result has 64.4 percent of original size [2019-11-06 19:23:47,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,209 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:141, output treesize:90 [2019-11-06 19:23:47,492 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-11-06 19:23:47,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 90 [2019-11-06 19:23:47,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:47,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:47,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:47,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:47,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:47,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:47,501 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:47,538 INFO L567 ElimStorePlain]: treesize reduction 24, result has 73.0 percent of original size [2019-11-06 19:23:47,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:47,562 INFO L341 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2019-11-06 19:23:47,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 42 [2019-11-06 19:23:47,564 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,584 INFO L567 ElimStorePlain]: treesize reduction 8, result has 78.9 percent of original size [2019-11-06 19:23:47,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:47,585 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:135, output treesize:30 [2019-11-06 19:23:47,636 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:47,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 30 [2019-11-06 19:23:47,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:47,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:47,657 INFO L567 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2019-11-06 19:23:47,658 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:47,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:3 [2019-11-06 19:23:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:47,681 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:47,681 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-11-06 19:23:47,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243298230] [2019-11-06 19:23:47,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 19:23:47,682 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:47,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 19:23:47,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-06 19:23:47,683 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 18 states. [2019-11-06 19:23:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:49,133 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2019-11-06 19:23:49,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-06 19:23:49,134 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-11-06 19:23:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:49,136 INFO L225 Difference]: With dead ends: 97 [2019-11-06 19:23:49,136 INFO L226 Difference]: Without dead ends: 95 [2019-11-06 19:23:49,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2019-11-06 19:23:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-06 19:23:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 53. [2019-11-06 19:23:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-06 19:23:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-11-06 19:23:49,147 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 22 [2019-11-06 19:23:49,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:49,148 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-11-06 19:23:49,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 19:23:49,148 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-11-06 19:23:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 19:23:49,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:49,149 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:49,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:49,354 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:49,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:49,355 INFO L82 PathProgramCache]: Analyzing trace with hash -319739169, now seen corresponding path program 2 times [2019-11-06 19:23:49,355 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:49,356 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153028388] [2019-11-06 19:23:49,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:49,592 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153028388] [2019-11-06 19:23:49,592 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749854922] [2019-11-06 19:23:49,592 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:49,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 19:23:49,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:49,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 65 conjunts are in the unsatisfiable core [2019-11-06 19:23:49,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:49,731 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:49,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:23:49,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,801 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:49,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,893 INFO L567 ElimStorePlain]: treesize reduction 14, result has 87.9 percent of original size [2019-11-06 19:23:49,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2019-11-06 19:23:49,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,946 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:49,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-11-06 19:23:49,975 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:50,002 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:23:50,003 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:50,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:50,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:50,025 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:104, output treesize:55 [2019-11-06 19:23:50,081 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:50,081 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:50,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:50,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:50,130 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_34|, |v_#memory_int_24|, |v_#memory_$Pointer$.offset_34|], 1=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|]} [2019-11-06 19:23:50,133 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:50,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:50,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-11-06 19:23:50,177 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:50,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:50,213 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:50,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:50,261 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:50,262 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 2 case distinctions, treesize of input 53 treesize of output 74 [2019-11-06 19:23:50,264 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:50,326 INFO L567 ElimStorePlain]: treesize reduction 48, result has 63.6 percent of original size [2019-11-06 19:23:50,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:50,332 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 33 treesize of output 39 [2019-11-06 19:23:50,333 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:50,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:50,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:50,360 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:130, output treesize:87 [2019-11-06 19:23:50,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:50,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-06 19:23:50,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:50,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:50,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:50,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:107, output treesize:91 [2019-11-06 19:23:50,858 INFO L341 Elim1Store]: treesize reduction 16, result has 83.3 percent of original size [2019-11-06 19:23:50,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 143 [2019-11-06 19:23:50,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:50,913 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:50,962 INFO L567 ElimStorePlain]: treesize reduction 97, result has 34.9 percent of original size [2019-11-06 19:23:50,986 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:50,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 35 [2019-11-06 19:23:50,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:50,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:50,997 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:50,997 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:7 [2019-11-06 19:23:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:51,004 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:51,004 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-11-06 19:23:51,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953370306] [2019-11-06 19:23:51,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 19:23:51,005 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:51,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 19:23:51,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=293, Unknown=2, NotChecked=0, Total=342 [2019-11-06 19:23:51,006 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 19 states. [2019-11-06 19:23:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:52,410 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2019-11-06 19:23:52,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 19:23:52,410 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-11-06 19:23:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:52,411 INFO L225 Difference]: With dead ends: 108 [2019-11-06 19:23:52,411 INFO L226 Difference]: Without dead ends: 82 [2019-11-06 19:23:52,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=646, Unknown=2, NotChecked=0, Total=756 [2019-11-06 19:23:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-06 19:23:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2019-11-06 19:23:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-06 19:23:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-11-06 19:23:52,430 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 25 [2019-11-06 19:23:52,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:52,431 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-11-06 19:23:52,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-06 19:23:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-11-06 19:23:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 19:23:52,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:52,432 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] [2019-11-06 19:23:52,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:52,633 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:52,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:52,634 INFO L82 PathProgramCache]: Analyzing trace with hash -986080041, now seen corresponding path program 1 times [2019-11-06 19:23:52,634 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:52,634 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788043997] [2019-11-06 19:23:52,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:52,888 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788043997] [2019-11-06 19:23:52,888 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060993294] [2019-11-06 19:23:52,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:52,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-06 19:23:53,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:53,013 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:53,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,034 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:53,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2019-11-06 19:23:53,104 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,104 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:53,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,139 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_38|], 2=[|v_#memory_$Pointer$.base_37|, |v_#memory_int_28|], 4=[|v_#memory_int_26|]} [2019-11-06 19:23:53,157 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 35 treesize of output 7 [2019-11-06 19:23:53,157 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,188 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:23:53,189 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:53,221 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:23:53,222 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:53,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-11-06 19:23:53,245 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,260 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:53,260 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:101, output treesize:42 [2019-11-06 19:23:53,357 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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:53,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,379 INFO L567 ElimStorePlain]: treesize reduction 12, result has 65.7 percent of original size [2019-11-06 19:23:53,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:53,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:23 [2019-11-06 19:23:53,431 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_int_27|], 6=[|v_#memory_int_29|]} [2019-11-06 19:23:53,434 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:53,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,490 INFO L341 Elim1Store]: treesize reduction 69, result has 31.7 percent of original size [2019-11-06 19:23:53,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47 [2019-11-06 19:23:53,491 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:53,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:53,512 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:45 [2019-11-06 19:23:53,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:53,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:17,668 WARN L191 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-11-06 19:24:17,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:17,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2019-11-06 19:24:17,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:17,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2019-11-06 19:24:17,686 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:17,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:17,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:17,696 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:65, output treesize:3 [2019-11-06 19:24:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:17,701 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:24:17,701 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-06 19:24:17,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954055903] [2019-11-06 19:24:17,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 19:24:17,702 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:17,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 19:24:17,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-06 19:24:17,703 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 16 states.