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-optional-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 18:08:12,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 18:08:12,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 18:08:12,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 18:08:12,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 18:08:12,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 18:08:12,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 18:08:12,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 18:08:12,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 18:08:12,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 18:08:12,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 18:08:12,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 18:08:12,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 18:08:12,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 18:08:12,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 18:08:12,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 18:08:12,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 18:08:12,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 18:08:12,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 18:08:12,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 18:08:12,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 18:08:12,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 18:08:12,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 18:08:12,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 18:08:12,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 18:08:12,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 18:08:12,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 18:08:12,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 18:08:12,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 18:08:12,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 18:08:12,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 18:08:12,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 18:08:12,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 18:08:12,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 18:08:12,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 18:08:12,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 18:08:12,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 18:08:12,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 18:08:12,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 18:08:12,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 18:08:12,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 18:08:12,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 18:08:12,583 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 18:08:12,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 18:08:12,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 18:08:12,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 18:08:12,586 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 18:08:12,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 18:08:12,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 18:08:12,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 18:08:12,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 18:08:12,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 18:08:12,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 18:08:12,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 18:08:12,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 18:08:12,589 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 18:08:12,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 18:08:12,589 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 18:08:12,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 18:08:12,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 18:08:12,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 18:08:12,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 18:08:12,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 18:08:12,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:08:12,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 18:08:12,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 18:08:12,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 18:08:12,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 18:08:12,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 18:08:12,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 18:08:12,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 18:08:12,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 18:08:12,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 18:08:12,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 18:08:12,864 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 18:08:12,865 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 18:08:12,865 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional-1.i [2019-10-13 18:08:12,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9805ca361/88bd0b8374644fbf82e86d96674f022d/FLAG19557a1e6 [2019-10-13 18:08:13,468 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 18:08:13,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-optional-1.i [2019-10-13 18:08:13,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9805ca361/88bd0b8374644fbf82e86d96674f022d/FLAG19557a1e6 [2019-10-13 18:08:13,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9805ca361/88bd0b8374644fbf82e86d96674f022d [2019-10-13 18:08:13,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 18:08:13,804 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 18:08:13,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 18:08:13,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 18:08:13,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 18:08:13,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:08:13" (1/1) ... [2019-10-13 18:08:13,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c381ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:13, skipping insertion in model container [2019-10-13 18:08:13,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:08:13" (1/1) ... [2019-10-13 18:08:13,817 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 18:08:13,855 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 18:08:14,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:08:14,279 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 18:08:14,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:08:14,406 INFO L192 MainTranslator]: Completed translation [2019-10-13 18:08:14,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:14 WrapperNode [2019-10-13 18:08:14,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 18:08:14,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 18:08:14,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 18:08:14,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 18:08:14,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:14" (1/1) ... [2019-10-13 18:08:14,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:14" (1/1) ... [2019-10-13 18:08:14,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:14" (1/1) ... [2019-10-13 18:08:14,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:14" (1/1) ... [2019-10-13 18:08:14,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:14" (1/1) ... [2019-10-13 18:08:14,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:14" (1/1) ... [2019-10-13 18:08:14,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:14" (1/1) ... [2019-10-13 18:08:14,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 18:08:14,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 18:08:14,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 18:08:14,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 18:08:14,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:08:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 18:08:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 18:08:14,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 18:08:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 18:08:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 18:08:14,544 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 18:08:14,544 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 18:08:14,544 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 18:08:14,545 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 18:08:14,545 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 18:08:14,546 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 18:08:14,546 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 18:08:14,546 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 18:08:14,546 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 18:08:14,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 18:08:14,548 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 18:08:14,550 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 18:08:14,550 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 18:08:14,550 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 18:08:14,550 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 18:08:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 18:08:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 18:08:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 18:08:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 18:08:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 18:08:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 18:08:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 18:08:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 18:08:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 18:08:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 18:08:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 18:08:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 18:08:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 18:08:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 18:08:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 18:08:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 18:08:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 18:08:14,554 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 18:08:14,554 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 18:08:14,554 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 18:08:14,554 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 18:08:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 18:08:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 18:08:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 18:08:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 18:08:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 18:08:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 18:08:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 18:08:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 18:08:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 18:08:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 18:08:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 18:08:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 18:08:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 18:08:14,557 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 18:08:14,557 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 18:08:14,557 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 18:08:14,557 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 18:08:14,557 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 18:08:14,557 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 18:08:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 18:08:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 18:08:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 18:08:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 18:08:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 18:08:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 18:08:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 18:08:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 18:08:14,560 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 18:08:14,560 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 18:08:14,560 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 18:08:14,560 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 18:08:14,561 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 18:08:14,561 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 18:08:14,561 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 18:08:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 18:08:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 18:08:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 18:08:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 18:08:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 18:08:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 18:08:14,563 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 18:08:14,563 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 18:08:14,563 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 18:08:14,563 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 18:08:14,564 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 18:08:14,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 18:08:14,565 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 18:08:14,565 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 18:08:14,565 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 18:08:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 18:08:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 18:08:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 18:08:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 18:08:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 18:08:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 18:08:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 18:08:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 18:08:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 18:08:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 18:08:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 18:08:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 18:08:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 18:08:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 18:08:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 18:08:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 18:08:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 18:08:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 18:08:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 18:08:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 18:08:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 18:08:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 18:08:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 18:08:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 18:08:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 18:08:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 18:08:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 18:08:15,201 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 18:08:15,201 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-13 18:08:15,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:08:15 BoogieIcfgContainer [2019-10-13 18:08:15,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 18:08:15,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 18:08:15,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 18:08:15,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 18:08:15,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:08:13" (1/3) ... [2019-10-13 18:08:15,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb78e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:08:15, skipping insertion in model container [2019-10-13 18:08:15,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:14" (2/3) ... [2019-10-13 18:08:15,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb78e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:08:15, skipping insertion in model container [2019-10-13 18:08:15,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:08:15" (3/3) ... [2019-10-13 18:08:15,210 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2019-10-13 18:08:15,219 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 18:08:15,227 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 18:08:15,237 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 18:08:15,261 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 18:08:15,262 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 18:08:15,262 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 18:08:15,262 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 18:08:15,262 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 18:08:15,263 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 18:08:15,263 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 18:08:15,263 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 18:08:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-13 18:08:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 18:08:15,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:15,288 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:15,290 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:15,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:15,296 INFO L82 PathProgramCache]: Analyzing trace with hash 905993573, now seen corresponding path program 1 times [2019-10-13 18:08:15,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:15,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745982370] [2019-10-13 18:08:15,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:15,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:15,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:15,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:15,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745982370] [2019-10-13 18:08:15,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:15,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 18:08:15,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607773680] [2019-10-13 18:08:15,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 18:08:15,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:15,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 18:08:15,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 18:08:15,516 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-10-13 18:08:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:15,659 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2019-10-13 18:08:15,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 18:08:15,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 18:08:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:15,692 INFO L225 Difference]: With dead ends: 57 [2019-10-13 18:08:15,692 INFO L226 Difference]: Without dead ends: 26 [2019-10-13 18:08:15,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 18:08:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-13 18:08:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-13 18:08:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 18:08:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-10-13 18:08:15,745 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2019-10-13 18:08:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:15,746 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-10-13 18:08:15,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 18:08:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-10-13 18:08:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 18:08:15,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:15,747 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:15,747 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:15,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:15,748 INFO L82 PathProgramCache]: Analyzing trace with hash 550815853, now seen corresponding path program 1 times [2019-10-13 18:08:15,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:15,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449428215] [2019-10-13 18:08:15,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:15,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:15,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:15,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449428215] [2019-10-13 18:08:15,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:15,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 18:08:15,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621457620] [2019-10-13 18:08:15,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 18:08:15,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:15,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 18:08:15,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:08:15,861 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 4 states. [2019-10-13 18:08:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:15,952 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-10-13 18:08:15,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 18:08:15,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-13 18:08:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:15,954 INFO L225 Difference]: With dead ends: 29 [2019-10-13 18:08:15,954 INFO L226 Difference]: Without dead ends: 27 [2019-10-13 18:08:15,955 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:08:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-13 18:08:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-13 18:08:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 18:08:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-13 18:08:15,967 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2019-10-13 18:08:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:15,968 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-13 18:08:15,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 18:08:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-10-13 18:08:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 18:08:15,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:15,971 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:15,971 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:15,971 INFO L82 PathProgramCache]: Analyzing trace with hash 550817775, now seen corresponding path program 1 times [2019-10-13 18:08:15,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:15,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966388775] [2019-10-13 18:08:15,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:15,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:15,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:16,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966388775] [2019-10-13 18:08:16,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:16,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 18:08:16,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081704751] [2019-10-13 18:08:16,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 18:08:16,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:16,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 18:08:16,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 18:08:16,172 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2019-10-13 18:08:16,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:16,421 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2019-10-13 18:08:16,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 18:08:16,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-13 18:08:16,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:16,423 INFO L225 Difference]: With dead ends: 44 [2019-10-13 18:08:16,423 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 18:08:16,424 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-13 18:08:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 18:08:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2019-10-13 18:08:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-13 18:08:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-10-13 18:08:16,430 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2019-10-13 18:08:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:16,430 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-10-13 18:08:16,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 18:08:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-10-13 18:08:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 18:08:16,431 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:16,432 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:16,432 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:16,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:16,432 INFO L82 PathProgramCache]: Analyzing trace with hash 548970733, now seen corresponding path program 1 times [2019-10-13 18:08:16,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:16,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930890435] [2019-10-13 18:08:16,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:16,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:16,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:16,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930890435] [2019-10-13 18:08:16,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:16,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 18:08:16,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181828623] [2019-10-13 18:08:16,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 18:08:16,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:16,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 18:08:16,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 18:08:16,756 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 8 states. [2019-10-13 18:08:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:17,284 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2019-10-13 18:08:17,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 18:08:17,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-10-13 18:08:17,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:17,286 INFO L225 Difference]: With dead ends: 90 [2019-10-13 18:08:17,286 INFO L226 Difference]: Without dead ends: 73 [2019-10-13 18:08:17,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-13 18:08:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-13 18:08:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-10-13 18:08:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 18:08:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2019-10-13 18:08:17,298 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 20 [2019-10-13 18:08:17,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:17,298 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2019-10-13 18:08:17,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 18:08:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2019-10-13 18:08:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 18:08:17,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:17,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:17,300 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1969142159, now seen corresponding path program 1 times [2019-10-13 18:08:17,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:17,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507580748] [2019-10-13 18:08:17,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:17,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:17,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:17,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507580748] [2019-10-13 18:08:17,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:17,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 18:08:17,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280776344] [2019-10-13 18:08:17,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 18:08:17,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:17,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 18:08:17,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 18:08:17,393 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand 7 states. [2019-10-13 18:08:17,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:17,610 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-10-13 18:08:17,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 18:08:17,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-13 18:08:17,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:17,612 INFO L225 Difference]: With dead ends: 85 [2019-10-13 18:08:17,612 INFO L226 Difference]: Without dead ends: 64 [2019-10-13 18:08:17,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-13 18:08:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-13 18:08:17,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2019-10-13 18:08:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 18:08:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2019-10-13 18:08:17,624 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 20 [2019-10-13 18:08:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:17,625 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-10-13 18:08:17,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 18:08:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2019-10-13 18:08:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 18:08:17,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:17,628 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:17,628 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:17,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:17,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2020944649, now seen corresponding path program 1 times [2019-10-13 18:08:17,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:17,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706665204] [2019-10-13 18:08:17,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:17,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:17,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:17,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706665204] [2019-10-13 18:08:17,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:17,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 18:08:17,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957151116] [2019-10-13 18:08:17,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 18:08:17,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:17,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 18:08:17,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 18:08:17,752 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 6 states. [2019-10-13 18:08:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:18,018 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2019-10-13 18:08:18,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 18:08:18,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-13 18:08:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:18,019 INFO L225 Difference]: With dead ends: 84 [2019-10-13 18:08:18,019 INFO L226 Difference]: Without dead ends: 82 [2019-10-13 18:08:18,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:08:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-13 18:08:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 50. [2019-10-13 18:08:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 18:08:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2019-10-13 18:08:18,028 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 21 [2019-10-13 18:08:18,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:18,029 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2019-10-13 18:08:18,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 18:08:18,029 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2019-10-13 18:08:18,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 18:08:18,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:18,030 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:18,030 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:18,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:18,031 INFO L82 PathProgramCache]: Analyzing trace with hash 61652601, now seen corresponding path program 1 times [2019-10-13 18:08:18,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:18,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591943826] [2019-10-13 18:08:18,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:18,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:18,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:18,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591943826] [2019-10-13 18:08:18,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185760361] [2019-10-13 18:08:18,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:18,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-13 18:08:18,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:18,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:08:18,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:18,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:18,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:18,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 18:08:18,774 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:18,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:08:18,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:18,836 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.1 percent of original size [2019-10-13 18:08:18,856 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 17 [2019-10-13 18:08:18,856 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:18,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:18,881 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 17 [2019-10-13 18:08:18,882 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:18,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:18,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:18,902 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:65 [2019-10-13 18:08:19,040 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-10-13 18:08:19,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,164 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-13 18:08:19,165 INFO L567 ElimStorePlain]: treesize reduction 46, result has 75.4 percent of original size [2019-10-13 18:08:19,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:19,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:19,233 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 111 [2019-10-13 18:08:19,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,342 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-13 18:08:19,343 INFO L567 ElimStorePlain]: treesize reduction 96, result has 57.1 percent of original size [2019-10-13 18:08:19,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:19,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2019-10-13 18:08:19,354 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:19,437 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:133, output treesize:108 [2019-10-13 18:08:19,609 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 47 [2019-10-13 18:08:19,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,716 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-13 18:08:19,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,719 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|], 12=[|v_#memory_$Pointer$.offset_43|], 20=[|v_#memory_$Pointer$.base_43|]} [2019-10-13 18:08:19,727 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:19,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,824 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:19,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:19,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:19,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:19,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 76 [2019-10-13 18:08:19,938 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:20,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:20,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:20,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:20,593 WARN L191 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 114 [2019-10-13 18:08:20,594 INFO L341 Elim1Store]: treesize reduction 170, result has 67.1 percent of original size [2019-10-13 18:08:20,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 182 treesize of output 418 [2019-10-13 18:08:20,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:20,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:20,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:20,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:20,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:20,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:20,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:20,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:20,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:20,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:20,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:20,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:20,807 INFO L496 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:22,517 WARN L191 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 288 DAG size of output: 67 [2019-10-13 18:08:22,518 INFO L567 ElimStorePlain]: treesize reduction 240062, result has 0.1 percent of original size [2019-10-13 18:08:22,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:22,520 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:285, output treesize:215 [2019-10-13 18:08:22,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:22,927 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:22,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2019-10-13 18:08:22,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158318650] [2019-10-13 18:08:22,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 18:08:22,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:22,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 18:08:22,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-10-13 18:08:22,929 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand 20 states. [2019-10-13 18:08:27,705 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-10-13 18:08:35,861 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 69 [2019-10-13 18:08:38,557 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-10-13 18:08:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:38,816 INFO L93 Difference]: Finished difference Result 232 states and 302 transitions. [2019-10-13 18:08:38,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-13 18:08:38,816 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-10-13 18:08:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:38,819 INFO L225 Difference]: With dead ends: 232 [2019-10-13 18:08:38,819 INFO L226 Difference]: Without dead ends: 215 [2019-10-13 18:08:38,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1209, Invalid=4168, Unknown=25, NotChecked=0, Total=5402 [2019-10-13 18:08:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-13 18:08:38,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 65. [2019-10-13 18:08:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-13 18:08:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2019-10-13 18:08:38,845 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 23 [2019-10-13 18:08:38,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:38,846 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2019-10-13 18:08:38,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 18:08:38,846 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2019-10-13 18:08:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 18:08:38,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:38,847 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:39,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:39,048 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:39,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:39,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1838507005, now seen corresponding path program 1 times [2019-10-13 18:08:39,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:39,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913153273] [2019-10-13 18:08:39,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:39,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:39,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:39,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913153273] [2019-10-13 18:08:39,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630880107] [2019-10-13 18:08:39,284 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-10-13 18:08:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:39,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-13 18:08:39,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:39,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:08:39,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:39,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:39,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:39,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 18:08:39,441 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:39,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:08:39,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:39,482 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-10-13 18:08:39,484 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 2=[|v_#memory_int_33|]} [2019-10-13 18:08:39,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:39,494 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 24 treesize of output 9 [2019-10-13 18:08:39,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:39,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:39,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-10-13 18:08:39,513 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:39,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:39,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:39,525 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:59, output treesize:27 [2019-10-13 18:08:39,613 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:39,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 18:08:39,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:39,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:39,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:39,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-13 18:08:39,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:39,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:39,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-13 18:08:39,671 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:39,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:39,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:39,685 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:17 [2019-10-13 18:08:39,708 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_35|], 4=[|v_#memory_int_38|]} [2019-10-13 18:08:39,710 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:39,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:39,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:39,781 INFO L341 Elim1Store]: treesize reduction 82, result has 32.2 percent of original size [2019-10-13 18:08:39,781 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 2 case distinctions, treesize of input 55 treesize of output 51 [2019-10-13 18:08:39,782 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:39,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:39,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:39,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:39,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:39,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:39,829 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:59, output treesize:13 [2019-10-13 18:08:39,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:39,865 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:39,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-10-13 18:08:39,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753231470] [2019-10-13 18:08:39,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 18:08:39,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:39,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 18:08:39,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-10-13 18:08:39,866 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand 15 states. [2019-10-13 18:08:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:40,353 INFO L93 Difference]: Finished difference Result 112 states and 145 transitions. [2019-10-13 18:08:40,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 18:08:40,354 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-10-13 18:08:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:40,355 INFO L225 Difference]: With dead ends: 112 [2019-10-13 18:08:40,355 INFO L226 Difference]: Without dead ends: 93 [2019-10-13 18:08:40,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-10-13 18:08:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-13 18:08:40,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2019-10-13 18:08:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-13 18:08:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2019-10-13 18:08:40,365 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 23 [2019-10-13 18:08:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:40,365 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2019-10-13 18:08:40,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 18:08:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2019-10-13 18:08:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 18:08:40,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:40,366 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:40,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:40,570 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:40,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:40,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1799525935, now seen corresponding path program 1 times [2019-10-13 18:08:40,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:40,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488060498] [2019-10-13 18:08:40,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:40,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:40,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:40,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488060498] [2019-10-13 18:08:40,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257048331] [2019-10-13 18:08:40,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:40,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-13 18:08:40,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:40,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:08:40,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:40,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:40,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:40,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 18:08:40,986 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-10-13 18:08:40,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:40,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:40,999 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-10-13 18:08:40,999 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:41,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:41,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:41,007 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-10-13 18:08:41,059 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:41,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:08:41,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:41,129 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.5 percent of original size [2019-10-13 18:08:41,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:41,140 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 37 treesize of output 27 [2019-10-13 18:08:41,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:41,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:41,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:41,173 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 37 treesize of output 27 [2019-10-13 18:08:41,174 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:41,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:41,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:41,197 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:57 [2019-10-13 18:08:41,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:41,292 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-10-13 18:08:41,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:41,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:41,374 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_45|], 6=[|v_#memory_$Pointer$.offset_47|], 12=[|v_#memory_$Pointer$.base_47|]} [2019-10-13 18:08:41,378 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:41,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:41,454 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:41,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:41,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:41,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:41,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:41,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 60 [2019-10-13 18:08:41,533 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:41,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:41,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:41,948 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-10-13 18:08:41,949 INFO L341 Elim1Store]: treesize reduction 111, result has 71.2 percent of original size [2019-10-13 18:08:41,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 131 treesize of output 323 [2019-10-13 18:08:41,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,953 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:42,088 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 51 [2019-10-13 18:08:42,089 INFO L567 ElimStorePlain]: treesize reduction 273, result has 32.8 percent of original size [2019-10-13 18:08:42,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:42,091 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:230, output treesize:151 [2019-10-13 18:08:42,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:42,208 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:42,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-10-13 18:08:42,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515670887] [2019-10-13 18:08:42,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 18:08:42,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 18:08:42,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=167, Unknown=1, NotChecked=0, Total=210 [2019-10-13 18:08:42,210 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 15 states. [2019-10-13 18:08:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:54,550 INFO L93 Difference]: Finished difference Result 201 states and 265 transitions. [2019-10-13 18:08:54,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 18:08:54,551 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-10-13 18:08:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:54,553 INFO L225 Difference]: With dead ends: 201 [2019-10-13 18:08:54,553 INFO L226 Difference]: Without dead ends: 182 [2019-10-13 18:08:54,555 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=316, Invalid=1161, Unknown=5, NotChecked=0, Total=1482 [2019-10-13 18:08:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-13 18:08:54,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 66. [2019-10-13 18:08:54,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 18:08:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2019-10-13 18:08:54,588 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 24 [2019-10-13 18:08:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:54,590 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2019-10-13 18:08:54,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 18:08:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2019-10-13 18:08:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 18:08:54,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:54,601 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:54,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:54,807 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:54,808 INFO L82 PathProgramCache]: Analyzing trace with hash -718586957, now seen corresponding path program 1 times [2019-10-13 18:08:54,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:54,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662237954] [2019-10-13 18:08:54,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:54,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:54,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:55,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662237954] [2019-10-13 18:08:55,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764868630] [2019-10-13 18:08:55,065 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-10-13 18:08:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:55,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-13 18:08:55,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:55,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:08:55,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:55,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:55,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:55,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 18:08:55,194 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-10-13 18:08:55,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:55,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:55,217 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-10-13 18:08:55,218 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:55,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:55,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:55,229 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-10-13 18:08:55,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:55,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:08:55,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:55,363 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.5 percent of original size [2019-10-13 18:08:55,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:55,371 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 37 treesize of output 27 [2019-10-13 18:08:55,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:55,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:55,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:55,410 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 37 treesize of output 27 [2019-10-13 18:08:55,410 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:55,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:55,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:55,439 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:57 [2019-10-13 18:08:55,538 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:55,539 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-10-13 18:08:55,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:55,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:55,621 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_49|], 6=[|v_#memory_$Pointer$.offset_51|], 12=[|v_#memory_$Pointer$.base_51|]} [2019-10-13 18:08:55,626 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:55,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:55,698 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:55,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:55,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:55,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:55,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:55,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 60 [2019-10-13 18:08:55,771 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:55,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:55,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:56,192 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-10-13 18:08:56,193 INFO L341 Elim1Store]: treesize reduction 111, result has 71.2 percent of original size [2019-10-13 18:08:56,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 131 treesize of output 323 [2019-10-13 18:08:56,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:56,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:56,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:56,216 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:56,597 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 51 [2019-10-13 18:08:56,597 INFO L567 ElimStorePlain]: treesize reduction 8121, result has 1.6 percent of original size [2019-10-13 18:08:56,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:56,599 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:227, output treesize:138 [2019-10-13 18:08:56,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:56,729 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:56,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-10-13 18:08:56,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024807654] [2019-10-13 18:08:56,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 18:08:56,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:56,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 18:08:56,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=141, Unknown=1, NotChecked=0, Total=182 [2019-10-13 18:08:56,730 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand 14 states.