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/dll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:25:30,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:25:30,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:25:30,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:25:30,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:25:30,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:25:30,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:25:30,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:25:30,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:25:30,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:25:30,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:25:30,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:25:30,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:25:30,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:25:30,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:25:30,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:25:30,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:25:30,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:25:30,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:25:30,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:25:30,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:25:30,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:25:30,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:25:30,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:25:30,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:25:30,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:25:30,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:25:30,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:25:30,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:25:30,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:25:30,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:25:30,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:25:30,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:25:30,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:25:30,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:25:30,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:25:30,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:25:30,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:25:30,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:25:30,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:25:30,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:25:30,791 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-16 16:25:30,806 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:25:30,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:25:30,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:25:30,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:25:30,808 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:25:30,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:25:30,808 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:25:30,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:25:30,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:25:30,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:25:30,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:25:30,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:25:30,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:25:30,811 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:25:30,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:25:30,812 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:25:30,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:25:30,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:25:30,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:25:30,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:25:30,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:25:30,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:25:30,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:25:30,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:25:30,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:25:30,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:25:30,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:25:30,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:25:30,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:25:30,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:25:30,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:25:30,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:25:30,865 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:25:30,866 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:25:30,866 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-09-16 16:25:30,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6455c43b7/8fb03e01cfd844caa6523971b6d8bf7e/FLAG070ac7528 [2019-09-16 16:25:31,439 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:25:31,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-09-16 16:25:31,467 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6455c43b7/8fb03e01cfd844caa6523971b6d8bf7e/FLAG070ac7528 [2019-09-16 16:25:31,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6455c43b7/8fb03e01cfd844caa6523971b6d8bf7e [2019-09-16 16:25:31,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:25:31,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:25:31,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:25:31,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:25:31,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:25:31,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:25:31" (1/1) ... [2019-09-16 16:25:31,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4baa6c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:31, skipping insertion in model container [2019-09-16 16:25:31,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:25:31" (1/1) ... [2019-09-16 16:25:31,776 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:25:31,828 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:25:32,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:25:32,285 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:25:32,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:25:32,394 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:25:32,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:32 WrapperNode [2019-09-16 16:25:32,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:25:32,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:25:32,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:25:32,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:25:32,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:32" (1/1) ... [2019-09-16 16:25:32,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:32" (1/1) ... [2019-09-16 16:25:32,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:32" (1/1) ... [2019-09-16 16:25:32,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:32" (1/1) ... [2019-09-16 16:25:32,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:32" (1/1) ... [2019-09-16 16:25:32,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:32" (1/1) ... [2019-09-16 16:25:32,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:32" (1/1) ... [2019-09-16 16:25:32,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:25:32,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:25:32,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:25:32,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:25:32,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:25:32,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:25:32,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:25:32,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:25:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-16 16:25:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-16 16:25:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-16 16:25:32,527 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-16 16:25:32,527 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-16 16:25:32,527 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-16 16:25:32,527 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-16 16:25:32,527 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-16 16:25:32,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-16 16:25:32,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-16 16:25:32,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-16 16:25:32,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-16 16:25:32,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-16 16:25:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-16 16:25:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-16 16:25:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-16 16:25:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-16 16:25:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-16 16:25:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-16 16:25:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-16 16:25:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-16 16:25:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-16 16:25:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-16 16:25:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-16 16:25:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-16 16:25:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-16 16:25:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-16 16:25:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-16 16:25:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-16 16:25:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-16 16:25:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-16 16:25:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-16 16:25:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-16 16:25:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-16 16:25:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-16 16:25:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-16 16:25:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-16 16:25:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-16 16:25:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-16 16:25:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-16 16:25:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-16 16:25:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-16 16:25:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-16 16:25:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-16 16:25:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-16 16:25:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-16 16:25:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-16 16:25:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-16 16:25:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-16 16:25:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-16 16:25:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 16:25:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 16:25:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-16 16:25:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-16 16:25:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-16 16:25:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-16 16:25:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-16 16:25:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-16 16:25:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-16 16:25:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-16 16:25:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-16 16:25:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-16 16:25:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-16 16:25:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-16 16:25:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-16 16:25:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-16 16:25:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-16 16:25:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-16 16:25:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-16 16:25:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-16 16:25:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-16 16:25:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-16 16:25:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-16 16:25:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-16 16:25:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-16 16:25:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-16 16:25:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-16 16:25:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-16 16:25:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-16 16:25:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-16 16:25:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-16 16:25:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-16 16:25:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-16 16:25:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-16 16:25:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-16 16:25:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-16 16:25:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-16 16:25:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-16 16:25:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-16 16:25:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-16 16:25:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-16 16:25:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-16 16:25:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-16 16:25:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-16 16:25:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-16 16:25:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-16 16:25:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-16 16:25:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-16 16:25:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-16 16:25:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-16 16:25:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-16 16:25:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-16 16:25:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-16 16:25:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:25:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:25:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:25:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 16:25:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 16:25:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 16:25:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 16:25:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:25:33,219 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:25:33,220 INFO L283 CfgBuilder]: Removed 30 assume(true) statements. [2019-09-16 16:25:33,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:25:33 BoogieIcfgContainer [2019-09-16 16:25:33,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:25:33,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:25:33,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:25:33,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:25:33,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:25:31" (1/3) ... [2019-09-16 16:25:33,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d55a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:25:33, skipping insertion in model container [2019-09-16 16:25:33,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:32" (2/3) ... [2019-09-16 16:25:33,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d55a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:25:33, skipping insertion in model container [2019-09-16 16:25:33,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:25:33" (3/3) ... [2019-09-16 16:25:33,232 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-09-16 16:25:33,242 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:25:33,251 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-09-16 16:25:33,265 INFO L252 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-09-16 16:25:33,290 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:25:33,291 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:25:33,291 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:25:33,291 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:25:33,292 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:25:33,292 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:25:33,292 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:25:33,292 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:25:33,292 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:25:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-09-16 16:25:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-09-16 16:25:33,327 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:33,329 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:33,339 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1861454184, now seen corresponding path program 1 times [2019-09-16 16:25:33,345 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:33,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:33,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:33,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:33,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:33,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:33,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:25:33,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:25:33,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:25:33,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:33,554 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-09-16 16:25:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:33,646 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2019-09-16 16:25:33,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:25:33,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-09-16 16:25:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:33,659 INFO L225 Difference]: With dead ends: 186 [2019-09-16 16:25:33,659 INFO L226 Difference]: Without dead ends: 99 [2019-09-16 16:25:33,663 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-16 16:25:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-16 16:25:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2019-09-16 16:25:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-16 16:25:33,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-09-16 16:25:33,708 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2019-09-16 16:25:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:33,708 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-09-16 16:25:33,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:25:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-09-16 16:25:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-16 16:25:33,709 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:33,710 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:33,710 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:33,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:33,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1461031906, now seen corresponding path program 1 times [2019-09-16 16:25:33,711 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:33,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:33,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:33,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:33,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:25:33,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:25:33,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:25:33,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:33,797 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 3 states. [2019-09-16 16:25:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:33,822 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-16 16:25:33,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:25:33,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-16 16:25:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:33,824 INFO L225 Difference]: With dead ends: 84 [2019-09-16 16:25:33,824 INFO L226 Difference]: Without dead ends: 82 [2019-09-16 16:25:33,825 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-16 16:25:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-16 16:25:33,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-09-16 16:25:33,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-16 16:25:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-09-16 16:25:33,835 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2019-09-16 16:25:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:33,836 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-09-16 16:25:33,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:25:33,836 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-09-16 16:25:33,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-16 16:25:33,837 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:33,837 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:33,837 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:33,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:33,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1461033828, now seen corresponding path program 1 times [2019-09-16 16:25:33,838 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:33,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:33,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:33,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:33,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:33,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:33,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:25:33,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:25:33,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:25:33,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:25:33,948 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 4 states. [2019-09-16 16:25:34,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:34,039 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-16 16:25:34,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:25:34,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-16 16:25:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:34,040 INFO L225 Difference]: With dead ends: 84 [2019-09-16 16:25:34,040 INFO L226 Difference]: Without dead ends: 82 [2019-09-16 16:25:34,041 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:25:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-16 16:25:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-09-16 16:25:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-16 16:25:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-09-16 16:25:34,050 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2019-09-16 16:25:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:34,051 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-09-16 16:25:34,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:25:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-09-16 16:25:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 16:25:34,052 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:34,052 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:34,052 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:34,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:34,053 INFO L82 PathProgramCache]: Analyzing trace with hash 177734485, now seen corresponding path program 1 times [2019-09-16 16:25:34,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:34,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:34,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:34,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:34,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:34,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:34,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:25:34,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:25:34,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:25:34,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:25:34,146 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 4 states. [2019-09-16 16:25:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:34,303 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2019-09-16 16:25:34,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:25:34,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-09-16 16:25:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:34,306 INFO L225 Difference]: With dead ends: 199 [2019-09-16 16:25:34,307 INFO L226 Difference]: Without dead ends: 132 [2019-09-16 16:25:34,310 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:25:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-16 16:25:34,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2019-09-16 16:25:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-16 16:25:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-09-16 16:25:34,325 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 19 [2019-09-16 16:25:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:34,326 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-09-16 16:25:34,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:25:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-09-16 16:25:34,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 16:25:34,327 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:34,327 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:34,327 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:34,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:34,328 INFO L82 PathProgramCache]: Analyzing trace with hash -631612141, now seen corresponding path program 1 times [2019-09-16 16:25:34,328 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:34,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:34,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:34,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:34,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:34,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:34,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:25:34,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:25:34,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:25:34,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:25:34,471 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 5 states. [2019-09-16 16:25:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:34,605 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2019-09-16 16:25:34,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:25:34,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-16 16:25:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:34,607 INFO L225 Difference]: With dead ends: 126 [2019-09-16 16:25:34,607 INFO L226 Difference]: Without dead ends: 122 [2019-09-16 16:25:34,608 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:25:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-16 16:25:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2019-09-16 16:25:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-16 16:25:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-09-16 16:25:34,616 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 19 [2019-09-16 16:25:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:34,616 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-09-16 16:25:34,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:25:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-09-16 16:25:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:25:34,617 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:34,617 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:34,618 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:34,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:34,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1894864309, now seen corresponding path program 1 times [2019-09-16 16:25:34,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:34,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:34,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:34,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:34,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:34,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:34,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:25:34,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:25:34,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:25:34,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:25:34,658 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 5 states. [2019-09-16 16:25:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:34,751 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2019-09-16 16:25:34,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:25:34,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-16 16:25:34,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:34,752 INFO L225 Difference]: With dead ends: 136 [2019-09-16 16:25:34,753 INFO L226 Difference]: Without dead ends: 116 [2019-09-16 16:25:34,753 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:25:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-16 16:25:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2019-09-16 16:25:34,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-16 16:25:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-09-16 16:25:34,760 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 20 [2019-09-16 16:25:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:34,761 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-09-16 16:25:34,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:25:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-09-16 16:25:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:25:34,762 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:34,762 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:34,762 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:34,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:34,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1337316768, now seen corresponding path program 1 times [2019-09-16 16:25:34,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:34,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:34,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:34,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:34,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:34,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:34,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:25:34,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:25:34,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:25:34,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:34,800 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 3 states. [2019-09-16 16:25:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:34,815 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2019-09-16 16:25:34,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:25:34,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 16:25:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:34,817 INFO L225 Difference]: With dead ends: 141 [2019-09-16 16:25:34,817 INFO L226 Difference]: Without dead ends: 100 [2019-09-16 16:25:34,818 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-16 16:25:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-16 16:25:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2019-09-16 16:25:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-16 16:25:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-09-16 16:25:34,829 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 24 [2019-09-16 16:25:34,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:34,830 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-09-16 16:25:34,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:25:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-09-16 16:25:34,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:25:34,831 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:34,831 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:34,835 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:34,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1492857654, now seen corresponding path program 1 times [2019-09-16 16:25:34,835 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:34,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:34,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:34,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:34,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:34,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:34,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:25:34,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:25:34,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:25:34,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:34,873 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 3 states. [2019-09-16 16:25:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:34,889 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2019-09-16 16:25:34,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:25:34,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:25:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:34,890 INFO L225 Difference]: With dead ends: 79 [2019-09-16 16:25:34,890 INFO L226 Difference]: Without dead ends: 77 [2019-09-16 16:25:34,891 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-16 16:25:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-16 16:25:34,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-09-16 16:25:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-16 16:25:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-09-16 16:25:34,896 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 25 [2019-09-16 16:25:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:34,896 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-09-16 16:25:34,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:25:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-09-16 16:25:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:25:34,898 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:34,898 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:34,898 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:34,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:34,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1632693981, now seen corresponding path program 1 times [2019-09-16 16:25:34,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:34,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:34,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:34,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:34,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:34,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:34,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:25:34,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:25:34,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:25:34,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:25:34,944 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2019-09-16 16:25:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:35,015 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2019-09-16 16:25:35,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:25:35,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-09-16 16:25:35,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:35,016 INFO L225 Difference]: With dead ends: 78 [2019-09-16 16:25:35,016 INFO L226 Difference]: Without dead ends: 76 [2019-09-16 16:25:35,017 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:25:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-16 16:25:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-16 16:25:35,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-16 16:25:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-09-16 16:25:35,022 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 27 [2019-09-16 16:25:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:35,023 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-09-16 16:25:35,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:25:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-09-16 16:25:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:25:35,024 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:35,024 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:35,025 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:35,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:35,025 INFO L82 PathProgramCache]: Analyzing trace with hash 668074133, now seen corresponding path program 1 times [2019-09-16 16:25:35,026 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:35,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:35,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:35,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:35,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:35,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:35,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:25:35,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:25:35,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:25:35,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:25:35,113 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 6 states. [2019-09-16 16:25:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:35,372 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2019-09-16 16:25:35,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:25:35,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-16 16:25:35,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:35,374 INFO L225 Difference]: With dead ends: 179 [2019-09-16 16:25:35,375 INFO L226 Difference]: Without dead ends: 137 [2019-09-16 16:25:35,375 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:25:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-16 16:25:35,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2019-09-16 16:25:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-16 16:25:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-09-16 16:25:35,384 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2019-09-16 16:25:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:35,385 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-09-16 16:25:35,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:25:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2019-09-16 16:25:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:25:35,389 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:35,389 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:35,390 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:35,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:35,390 INFO L82 PathProgramCache]: Analyzing trace with hash 567478293, now seen corresponding path program 1 times [2019-09-16 16:25:35,390 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:35,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:35,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:35,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:35,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:35,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:35,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-16 16:25:35,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:25:35,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:25:35,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:25:35,677 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 9 states. [2019-09-16 16:25:36,416 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-16 16:25:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:36,671 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2019-09-16 16:25:36,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-16 16:25:36,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-09-16 16:25:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:36,674 INFO L225 Difference]: With dead ends: 175 [2019-09-16 16:25:36,674 INFO L226 Difference]: Without dead ends: 173 [2019-09-16 16:25:36,675 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-09-16 16:25:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-16 16:25:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 104. [2019-09-16 16:25:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-16 16:25:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2019-09-16 16:25:36,685 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 28 [2019-09-16 16:25:36,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:36,685 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-09-16 16:25:36,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:25:36,686 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2019-09-16 16:25:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:25:36,688 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:36,688 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:36,689 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:36,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1429819819, now seen corresponding path program 1 times [2019-09-16 16:25:36,689 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:36,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:36,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:36,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:36,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 16:25:36,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:36,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:25:36,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:25:36,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:25:36,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:25:36,788 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 5 states. [2019-09-16 16:25:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:36,896 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2019-09-16 16:25:36,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:25:36,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-16 16:25:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:36,897 INFO L225 Difference]: With dead ends: 151 [2019-09-16 16:25:36,897 INFO L226 Difference]: Without dead ends: 133 [2019-09-16 16:25:36,898 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:25:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-16 16:25:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2019-09-16 16:25:36,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-16 16:25:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2019-09-16 16:25:36,906 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 30 [2019-09-16 16:25:36,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:36,906 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2019-09-16 16:25:36,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:25:36,906 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2019-09-16 16:25:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:25:36,907 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:36,907 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:36,908 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:36,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:36,908 INFO L82 PathProgramCache]: Analyzing trace with hash -753501909, now seen corresponding path program 1 times [2019-09-16 16:25:36,908 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:36,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:36,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:36,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:36,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 16:25:36,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:36,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:25:36,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:25:36,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:25:36,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:36,934 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand 3 states. [2019-09-16 16:25:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:36,975 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2019-09-16 16:25:36,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:25:36,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 16:25:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:36,977 INFO L225 Difference]: With dead ends: 125 [2019-09-16 16:25:36,977 INFO L226 Difference]: Without dead ends: 123 [2019-09-16 16:25:36,978 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-16 16:25:36,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-16 16:25:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-09-16 16:25:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-16 16:25:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-09-16 16:25:36,985 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 30 [2019-09-16 16:25:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:36,985 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-09-16 16:25:36,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:25:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-09-16 16:25:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 16:25:36,986 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:36,986 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:36,987 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:36,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:36,987 INFO L82 PathProgramCache]: Analyzing trace with hash 758661948, now seen corresponding path program 1 times [2019-09-16 16:25:36,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:36,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:36,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:36,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:36,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:37,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:37,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-16 16:25:37,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:25:37,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:25:37,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:25:37,185 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 9 states. [2019-09-16 16:25:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:37,790 INFO L93 Difference]: Finished difference Result 201 states and 229 transitions. [2019-09-16 16:25:37,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-16 16:25:37,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-16 16:25:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:37,792 INFO L225 Difference]: With dead ends: 201 [2019-09-16 16:25:37,792 INFO L226 Difference]: Without dead ends: 199 [2019-09-16 16:25:37,793 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-09-16 16:25:37,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-16 16:25:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 129. [2019-09-16 16:25:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-16 16:25:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-09-16 16:25:37,801 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2019-09-16 16:25:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:37,802 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-09-16 16:25:37,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:25:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-09-16 16:25:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 16:25:37,803 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:37,803 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:37,804 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:37,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:37,804 INFO L82 PathProgramCache]: Analyzing trace with hash -999338862, now seen corresponding path program 1 times [2019-09-16 16:25:37,804 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:37,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:37,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:37,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:37,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:37,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:25:37,853 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:25:37,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:37,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-16 16:25:37,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:25:38,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:38,066 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 16 treesize of output 17 [2019-09-16 16:25:38,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:38,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:38,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:38,089 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 16 treesize of output 17 [2019-09-16 16:25:38,089 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:38,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:38,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:38,100 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:36 [2019-09-16 16:25:38,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:38,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:38,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:38,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-09-16 16:25:38,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:38,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:38,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:38,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:38,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:38,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-09-16 16:25:38,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:38,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:38,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:38,179 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2019-09-16 16:25:38,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-09-16 16:25:38,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:38,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:38,269 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:38,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-09-16 16:25:38,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:38,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:38,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:38,275 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-09-16 16:25:38,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-16 16:25:38,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:25:38,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-09-16 16:25:38,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:25:38,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:25:38,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:25:38,297 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 8 states. [2019-09-16 16:25:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:38,633 INFO L93 Difference]: Finished difference Result 220 states and 252 transitions. [2019-09-16 16:25:38,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 16:25:38,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-09-16 16:25:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:38,634 INFO L225 Difference]: With dead ends: 220 [2019-09-16 16:25:38,634 INFO L226 Difference]: Without dead ends: 160 [2019-09-16 16:25:38,635 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-09-16 16:25:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-16 16:25:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120. [2019-09-16 16:25:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-16 16:25:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2019-09-16 16:25:38,643 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 33 [2019-09-16 16:25:38,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:38,643 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2019-09-16 16:25:38,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:25:38,643 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2019-09-16 16:25:38,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 16:25:38,644 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:38,644 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:38,644 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:38,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:38,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2072098386, now seen corresponding path program 1 times [2019-09-16 16:25:38,645 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:38,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:38,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:38,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:38,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:38,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:38,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:25:38,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:25:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:25:38,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:25:38,801 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand 6 states. [2019-09-16 16:25:38,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:38,982 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2019-09-16 16:25:38,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:25:38,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-09-16 16:25:38,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:38,984 INFO L225 Difference]: With dead ends: 161 [2019-09-16 16:25:38,984 INFO L226 Difference]: Without dead ends: 141 [2019-09-16 16:25:38,985 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:25:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-16 16:25:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2019-09-16 16:25:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-16 16:25:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2019-09-16 16:25:38,993 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 33 [2019-09-16 16:25:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:38,994 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2019-09-16 16:25:38,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:25:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2019-09-16 16:25:38,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 16:25:38,995 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:38,995 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:38,995 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:38,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:38,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1941174974, now seen corresponding path program 1 times [2019-09-16 16:25:38,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:38,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:38,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:38,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:38,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:39,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:39,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:25:39,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:25:39,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:25:39,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:39,023 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 3 states. [2019-09-16 16:25:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:39,040 INFO L93 Difference]: Finished difference Result 224 states and 258 transitions. [2019-09-16 16:25:39,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:25:39,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-16 16:25:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:39,042 INFO L225 Difference]: With dead ends: 224 [2019-09-16 16:25:39,042 INFO L226 Difference]: Without dead ends: 169 [2019-09-16 16:25:39,043 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-16 16:25:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-16 16:25:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 142. [2019-09-16 16:25:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-16 16:25:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2019-09-16 16:25:39,052 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 35 [2019-09-16 16:25:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:39,052 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2019-09-16 16:25:39,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:25:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2019-09-16 16:25:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-16 16:25:39,053 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:39,053 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:39,054 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:39,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash 930038423, now seen corresponding path program 1 times [2019-09-16 16:25:39,054 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:39,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:39,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:39,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:39,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:39,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:25:39,146 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:25:39,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:39,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-16 16:25:39,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:25:39,285 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-09-16 16:25:39,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:39,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:39,299 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-09-16 16:25:39,300 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:39,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:39,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:39,308 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-09-16 16:25:39,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:39,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-09-16 16:25:39,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:39,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:39,424 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-09-16 16:25:39,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-09-16 16:25:39,425 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:39,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:39,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:39,430 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-09-16 16:25:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:39,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:25:39,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-09-16 16:25:39,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 16:25:39,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 16:25:39,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:25:39,447 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 10 states. [2019-09-16 16:25:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:39,775 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2019-09-16 16:25:39,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-16 16:25:39,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-09-16 16:25:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:39,777 INFO L225 Difference]: With dead ends: 268 [2019-09-16 16:25:39,777 INFO L226 Difference]: Without dead ends: 224 [2019-09-16 16:25:39,777 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-09-16 16:25:39,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-16 16:25:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 169. [2019-09-16 16:25:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-16 16:25:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2019-09-16 16:25:39,788 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 36 [2019-09-16 16:25:39,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:39,788 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2019-09-16 16:25:39,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 16:25:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2019-09-16 16:25:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-16 16:25:39,789 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:39,789 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:39,789 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:39,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1341973316, now seen corresponding path program 1 times [2019-09-16 16:25:39,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:39,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:39,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:39,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:39,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:39,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:25:39,997 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:25:40,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:40,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-16 16:25:40,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:25:40,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:25:40,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:40,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:40,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:40,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-16 16:25:40,133 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-09-16 16:25:40,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:40,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:40,145 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-09-16 16:25:40,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:40,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:40,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:40,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-09-16 16:25:40,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:40,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-16 16:25:40,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:40,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:40,244 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_41|], 16=[|v_#memory_$Pointer$.base_41|]} [2019-09-16 16:25:40,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:40,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:40,259 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:25:40,285 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:40,285 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 1 case distinctions, treesize of input 73 treesize of output 58 [2019-09-16 16:25:40,286 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:40,349 INFO L567 ElimStorePlain]: treesize reduction 22, result has 86.8 percent of original size [2019-09-16 16:25:40,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:40,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:40,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:40,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 123 [2019-09-16 16:25:40,429 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:40,518 INFO L567 ElimStorePlain]: treesize reduction 78, result has 50.9 percent of original size [2019-09-16 16:25:40,520 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-09-16 16:25:40,520 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:191, output treesize:95 [2019-09-16 16:25:40,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:40,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:40,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:40,641 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:40,641 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 4 case distinctions, treesize of input 131 treesize of output 227 [2019-09-16 16:25:40,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:40,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:40,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:40,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:40,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:40,807 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-09-16 16:25:40,807 INFO L341 Elim1Store]: treesize reduction 60, result has 74.5 percent of original size [2019-09-16 16:25:40,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 128 treesize of output 245 [2019-09-16 16:25:40,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:40,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:40,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:40,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:25:40,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:40,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:25:40,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:40,822 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:41,143 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-09-16 16:25:41,143 INFO L567 ElimStorePlain]: treesize reduction 1421, result has 15.2 percent of original size [2019-09-16 16:25:41,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:41,340 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-16 16:25:41,341 INFO L341 Elim1Store]: treesize reduction 66, result has 72.6 percent of original size [2019-09-16 16:25:41,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 133 treesize of output 267 [2019-09-16 16:25:41,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,364 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:41,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:41,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:41,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 225 [2019-09-16 16:25:41,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:25:41,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:25:41,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:25:41,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,484 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:41,756 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 55 [2019-09-16 16:25:41,757 INFO L567 ElimStorePlain]: treesize reduction 1107, result has 16.5 percent of original size [2019-09-16 16:25:41,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-09-16 16:25:41,761 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:260, output treesize:223 [2019-09-16 16:25:41,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:41,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,287 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-16 16:25:42,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:25:42,308 INFO L392 ElimStorePlain]: Different costs {10=[v_prenex_2, v_prenex_3, v_prenex_5, v_prenex_6], 18=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} [2019-09-16 16:25:42,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:42,357 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:42,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 132 [2019-09-16 16:25:42,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,362 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:42,491 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2019-09-16 16:25:42,492 INFO L567 ElimStorePlain]: treesize reduction 36, result has 88.3 percent of original size [2019-09-16 16:25:42,503 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:42,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2019-09-16 16:25:42,504 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:42,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:42,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:42,594 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:42,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 132 [2019-09-16 16:25:42,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,601 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:42,693 INFO L567 ElimStorePlain]: treesize reduction 36, result has 83.3 percent of original size [2019-09-16 16:25:42,702 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:42,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2019-09-16 16:25:42,704 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:42,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:42,855 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-16 16:25:42,855 INFO L341 Elim1Store]: treesize reduction 10, result has 92.2 percent of original size [2019-09-16 16:25:42,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 119 treesize of output 184 [2019-09-16 16:25:42,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:42,907 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:42,999 INFO L567 ElimStorePlain]: treesize reduction 88, result has 54.2 percent of original size [2019-09-16 16:25:43,023 INFO L341 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2019-09-16 16:25:43,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 68 [2019-09-16 16:25:43,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:43,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:43,027 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:43,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:43,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:43,067 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:330, output treesize:7 [2019-09-16 16:25:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:43,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:25:43,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-16 16:25:43,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-16 16:25:43,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-16 16:25:43,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=115, Unknown=1, NotChecked=0, Total=156 [2019-09-16 16:25:43,102 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand 13 states. [2019-09-16 16:25:43,451 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-16 16:25:43,955 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-09-16 16:25:44,214 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2019-09-16 16:25:44,466 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-16 16:25:44,656 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-16 16:25:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:44,964 INFO L93 Difference]: Finished difference Result 449 states and 525 transitions. [2019-09-16 16:25:44,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-16 16:25:44,965 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-16 16:25:44,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:44,967 INFO L225 Difference]: With dead ends: 449 [2019-09-16 16:25:44,967 INFO L226 Difference]: Without dead ends: 361 [2019-09-16 16:25:44,968 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=193, Invalid=560, Unknown=3, NotChecked=0, Total=756 [2019-09-16 16:25:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-09-16 16:25:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 191. [2019-09-16 16:25:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-16 16:25:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 225 transitions. [2019-09-16 16:25:44,982 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 225 transitions. Word has length 40 [2019-09-16 16:25:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:44,983 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 225 transitions. [2019-09-16 16:25:44,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-16 16:25:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 225 transitions. [2019-09-16 16:25:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-16 16:25:44,983 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:44,984 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:44,984 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:44,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:44,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2026576836, now seen corresponding path program 1 times [2019-09-16 16:25:44,985 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:44,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:44,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:44,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:44,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:45,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:25:45,538 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:25:45,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:45,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-16 16:25:45,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:25:45,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:25:45,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:45,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:45,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:45,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-16 16:25:45,680 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:45,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-16 16:25:45,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:45,761 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.3 percent of original size [2019-09-16 16:25:45,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:45,767 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:25:45,782 INFO L341 Elim1Store]: treesize reduction 87, result has 9.4 percent of original size [2019-09-16 16:25:45,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 193 [2019-09-16 16:25:45,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:45,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:45,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:45,819 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 42 treesize of output 31 [2019-09-16 16:25:45,819 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:45,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:45,843 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-09-16 16:25:45,844 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2019-09-16 16:25:45,976 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:45,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-09-16 16:25:45,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:46,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:46,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:46,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:46,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:46,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:46,077 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:25:46,090 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:46,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 85 [2019-09-16 16:25:46,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:46,201 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-16 16:25:46,202 INFO L567 ElimStorePlain]: treesize reduction 16, result has 92.7 percent of original size [2019-09-16 16:25:46,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:46,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:46,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:46,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:46,216 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:25:46,253 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:46,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 137 [2019-09-16 16:25:46,256 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:46,403 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-16 16:25:46,403 INFO L567 ElimStorePlain]: treesize reduction 132, result has 49.0 percent of original size [2019-09-16 16:25:46,404 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-09-16 16:25:46,405 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:276, output treesize:140 [2019-09-16 16:25:46,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:46,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:25:46,522 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:46,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 157 treesize of output 183 [2019-09-16 16:25:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:46,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:46,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:46,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:46,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:46,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:46,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:46,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:46,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:46,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:46,532 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:46,670 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-16 16:25:46,670 INFO L567 ElimStorePlain]: treesize reduction 114, result has 54.9 percent of original size [2019-09-16 16:25:46,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:46,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:46,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:46,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 82 [2019-09-16 16:25:46,687 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:46,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:46,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:46,721 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:152 [2019-09-16 16:25:47,032 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:25:47,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:47,099 INFO L341 Elim1Store]: treesize reduction 16, result has 76.5 percent of original size [2019-09-16 16:25:47,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 165 treesize of output 132 [2019-09-16 16:25:47,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:47,113 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:47,180 INFO L567 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-09-16 16:25:47,198 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:47,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 46 [2019-09-16 16:25:47,199 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:47,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:47,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:47,211 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:179, output treesize:7 [2019-09-16 16:25:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:47,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:25:47,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-09-16 16:25:47,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-16 16:25:47,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-16 16:25:47,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-09-16 16:25:47,243 INFO L87 Difference]: Start difference. First operand 191 states and 225 transitions. Second operand 19 states. [2019-09-16 16:25:47,511 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-09-16 16:25:48,004 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-16 16:25:48,466 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-09-16 16:25:48,720 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2019-09-16 16:25:49,027 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 109 [2019-09-16 16:25:49,249 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-09-16 16:25:49,380 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-16 16:25:49,778 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2019-09-16 16:25:50,156 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2019-09-16 16:25:50,417 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2019-09-16 16:25:50,701 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2019-09-16 16:25:51,020 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-16 16:25:51,590 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-16 16:25:51,945 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-16 16:25:52,263 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-16 16:25:52,399 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-16 16:25:52,619 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-16 16:25:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:52,753 INFO L93 Difference]: Finished difference Result 752 states and 865 transitions. [2019-09-16 16:25:52,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-16 16:25:52,753 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-16 16:25:52,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:52,757 INFO L225 Difference]: With dead ends: 752 [2019-09-16 16:25:52,757 INFO L226 Difference]: Without dead ends: 750 [2019-09-16 16:25:52,759 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=602, Invalid=1750, Unknown=0, NotChecked=0, Total=2352 [2019-09-16 16:25:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-09-16 16:25:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 225. [2019-09-16 16:25:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-16 16:25:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2019-09-16 16:25:52,800 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 40 [2019-09-16 16:25:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:52,801 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2019-09-16 16:25:52,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-16 16:25:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2019-09-16 16:25:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-16 16:25:52,801 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:52,802 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:52,802 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:52,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:52,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1168199972, now seen corresponding path program 1 times [2019-09-16 16:25:52,803 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:52,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:52,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:52,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:52,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:52,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:25:52,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:25:52,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:25:52,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:25:52,853 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand 5 states. [2019-09-16 16:25:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:52,928 INFO L93 Difference]: Finished difference Result 291 states and 342 transitions. [2019-09-16 16:25:52,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:25:52,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-09-16 16:25:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:52,931 INFO L225 Difference]: With dead ends: 291 [2019-09-16 16:25:52,931 INFO L226 Difference]: Without dead ends: 177 [2019-09-16 16:25:52,931 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:25:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-16 16:25:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-16 16:25:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-16 16:25:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2019-09-16 16:25:52,943 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 42 [2019-09-16 16:25:52,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:52,943 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2019-09-16 16:25:52,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:25:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2019-09-16 16:25:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-16 16:25:52,944 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:52,944 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:52,945 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:52,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash 608870837, now seen corresponding path program 1 times [2019-09-16 16:25:52,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:52,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:52,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:52,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:52,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:53,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:25:53,458 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:25:53,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:53,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-16 16:25:53,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:25:53,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:25:53,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:53,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:53,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:53,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-16 16:25:53,622 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:53,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-16 16:25:53,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:53,693 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.3 percent of original size [2019-09-16 16:25:53,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:53,714 INFO L341 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2019-09-16 16:25:53,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 130 [2019-09-16 16:25:53,715 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:53,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:53,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:53,744 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 42 treesize of output 31 [2019-09-16 16:25:53,744 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:53,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:53,768 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-09-16 16:25:53,768 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2019-09-16 16:25:53,891 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:53,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-09-16 16:25:53,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:53,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:53,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:53,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:53,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:53,981 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:25:53,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:53,990 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:25:54,027 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:54,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 137 [2019-09-16 16:25:54,029 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:54,187 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-16 16:25:54,187 INFO L567 ElimStorePlain]: treesize reduction 132, result has 59.4 percent of original size [2019-09-16 16:25:54,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:54,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:54,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:54,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:54,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 85 [2019-09-16 16:25:54,213 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:54,296 INFO L567 ElimStorePlain]: treesize reduction 16, result has 88.8 percent of original size [2019-09-16 16:25:54,297 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-09-16 16:25:54,298 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:276, output treesize:140 [2019-09-16 16:25:54,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:54,374 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:25:54,410 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:54,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 157 treesize of output 183 [2019-09-16 16:25:54,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,427 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:54,521 INFO L567 ElimStorePlain]: treesize reduction 114, result has 54.9 percent of original size [2019-09-16 16:25:54,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:54,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:54,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:54,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 82 [2019-09-16 16:25:54,529 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:54,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:54,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:54,566 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:152 [2019-09-16 16:25:54,910 INFO L341 Elim1Store]: treesize reduction 16, result has 76.5 percent of original size [2019-09-16 16:25:54,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 161 treesize of output 130 [2019-09-16 16:25:54,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:54,930 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:55,023 INFO L567 ElimStorePlain]: treesize reduction 32, result has 71.4 percent of original size [2019-09-16 16:25:55,037 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:55,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 44 [2019-09-16 16:25:55,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:55,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:55,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:55,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:175, output treesize:7 [2019-09-16 16:25:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 16:25:55,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:25:55,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-09-16 16:25:55,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-16 16:25:55,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-16 16:25:55,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-09-16 16:25:55,100 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 19 states. [2019-09-16 16:25:55,789 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-16 16:25:56,249 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-09-16 16:25:56,510 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2019-09-16 16:25:56,777 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 111 [2019-09-16 16:25:57,000 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-09-16 16:25:57,494 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 103 [2019-09-16 16:25:57,844 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-16 16:25:58,152 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 115 [2019-09-16 16:25:58,473 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2019-09-16 16:25:58,714 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-16 16:25:59,011 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-16 16:25:59,524 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-09-16 16:25:59,672 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-16 16:26:00,040 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-16 16:26:00,363 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-16 16:26:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:26:00,870 INFO L93 Difference]: Finished difference Result 579 states and 633 transitions. [2019-09-16 16:26:00,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-16 16:26:00,872 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2019-09-16 16:26:00,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:26:00,874 INFO L225 Difference]: With dead ends: 579 [2019-09-16 16:26:00,875 INFO L226 Difference]: Without dead ends: 577 [2019-09-16 16:26:00,876 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=662, Invalid=1888, Unknown=0, NotChecked=0, Total=2550 [2019-09-16 16:26:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-16 16:26:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 203. [2019-09-16 16:26:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-16 16:26:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 233 transitions. [2019-09-16 16:26:00,893 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 233 transitions. Word has length 43 [2019-09-16 16:26:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:26:00,894 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 233 transitions. [2019-09-16 16:26:00,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-16 16:26:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 233 transitions. [2019-09-16 16:26:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-16 16:26:00,895 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:26:00,895 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:26:00,895 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:26:00,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:26:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash 938403788, now seen corresponding path program 1 times [2019-09-16 16:26:00,896 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:26:00,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:26:00,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:26:00,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:26:00,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:26:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:26:01,325 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2019-09-16 16:26:01,481 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-09-16 16:26:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:26:01,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:26:01,702 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:26:01,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:26:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:26:01,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-16 16:26:01,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:26:01,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:01,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 54 [2019-09-16 16:26:01,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:01,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:01,969 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:26:01,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:02,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:26:02,189 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-16 16:26:02,196 INFO L168 Benchmark]: Toolchain (without parser) took 30436.32 ms. Allocated memory was 130.0 MB in the beginning and 556.8 MB in the end (delta: 426.8 MB). Free memory was 84.2 MB in the beginning and 380.6 MB in the end (delta: -296.4 MB). Peak memory consumption was 130.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:26:02,196 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 130.0 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:26:02,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.93 ms. Allocated memory was 130.0 MB in the beginning and 198.7 MB in the end (delta: 68.7 MB). Free memory was 84.0 MB in the beginning and 162.4 MB in the end (delta: -78.4 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-09-16 16:26:02,197 INFO L168 Benchmark]: Boogie Preprocessor took 77.27 ms. Allocated memory is still 198.7 MB. Free memory was 162.4 MB in the beginning and 159.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:26:02,197 INFO L168 Benchmark]: RCFGBuilder took 748.55 ms. Allocated memory is still 198.7 MB. Free memory was 159.0 MB in the beginning and 104.3 MB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 7.1 GB. [2019-09-16 16:26:02,198 INFO L168 Benchmark]: TraceAbstraction took 28971.26 ms. Allocated memory was 198.7 MB in the beginning and 556.8 MB in the end (delta: 358.1 MB). Free memory was 104.3 MB in the beginning and 380.6 MB in the end (delta: -276.3 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:26:02,200 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 130.0 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 633.93 ms. Allocated memory was 130.0 MB in the beginning and 198.7 MB in the end (delta: 68.7 MB). Free memory was 84.0 MB in the beginning and 162.4 MB in the end (delta: -78.4 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 77.27 ms. Allocated memory is still 198.7 MB. Free memory was 162.4 MB in the beginning and 159.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 748.55 ms. Allocated memory is still 198.7 MB. Free memory was 159.0 MB in the beginning and 104.3 MB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28971.26 ms. Allocated memory was 198.7 MB in the beginning and 556.8 MB in the end (delta: 358.1 MB). Free memory was 104.3 MB in the beginning and 380.6 MB in the end (delta: -276.3 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...