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/heap-manipulation/merge_sort-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 22:08:12,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:08:12,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:08:12,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:08:12,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:08:12,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:08:12,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:08:12,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:08:12,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:08:12,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:08:12,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:08:12,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:08:12,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:08:12,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:08:12,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:08:12,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:08:12,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:08:12,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:08:12,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:08:12,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:08:12,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:08:12,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:08:12,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:08:12,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:08:12,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:08:12,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:08:12,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:08:12,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:08:12,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:08:12,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:08:12,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:08:12,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:08:12,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:08:12,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:08:12,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:08:12,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:08:12,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:08:12,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:08:12,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:08:12,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:08:12,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:08:12,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 22:08:12,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:08:12,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:08:12,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:08:12,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:08:12,654 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:08:12,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:08:12,654 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:08:12,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:08:12,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:08:12,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:08:12,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:08:12,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:08:12,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:08:12,657 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:08:12,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:08:12,657 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:08:12,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:08:12,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:08:12,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:08:12,658 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:08:12,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:08:12,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:08:12,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:08:12,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:08:12,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:08:12,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:08:12,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:08:12,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:08:12,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:08:12,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:08:12,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:08:12,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:08:12,957 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:08:12,957 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:08:12,958 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2019-10-14 22:08:13,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b05aabc5/7b264c35d0aa426da0ae79552817e66e/FLAG2b5e2a912 [2019-10-14 22:08:13,601 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:08:13,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2019-10-14 22:08:13,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b05aabc5/7b264c35d0aa426da0ae79552817e66e/FLAG2b5e2a912 [2019-10-14 22:08:13,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b05aabc5/7b264c35d0aa426da0ae79552817e66e [2019-10-14 22:08:13,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:08:13,899 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:08:13,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:08:13,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:08:13,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:08:13,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:08:13" (1/1) ... [2019-10-14 22:08:13,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599a6431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:13, skipping insertion in model container [2019-10-14 22:08:13,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:08:13" (1/1) ... [2019-10-14 22:08:13,923 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:08:13,992 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:08:14,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:08:14,500 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:08:14,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:08:14,622 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:08:14,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14 WrapperNode [2019-10-14 22:08:14,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:08:14,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:08:14,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:08:14,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:08:14,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2019-10-14 22:08:14,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2019-10-14 22:08:14,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2019-10-14 22:08:14,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2019-10-14 22:08:14,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2019-10-14 22:08:14,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2019-10-14 22:08:14,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... [2019-10-14 22:08:14,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:08:14,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:08:14,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:08:14,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:08:14,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:08:14,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:08:14,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:08:14,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 22:08:14,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 22:08:14,787 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-10-14 22:08:14,787 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-10-14 22:08:14,787 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-10-14 22:08:14,787 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-10-14 22:08:14,787 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-10-14 22:08:14,788 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-10-14 22:08:14,788 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:08:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:08:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 22:08:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 22:08:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:08:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:08:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:08:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:08:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:08:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:08:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:08:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:08:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:08:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:08:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:08:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:08:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:08:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:08:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:08:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:08:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:08:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:08:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:08:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:08:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:08:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:08:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:08:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:08:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:08:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:08:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:08:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:08:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:08:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:08:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:08:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:08:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:08:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:08:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:08:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:08:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:08:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:08:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:08:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:08:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:08:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:08:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:08:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:08:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:08:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:08:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:08:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:08:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:08:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:08:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:08:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:08:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:08:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:08:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:08:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:08:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:08:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:08:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:08:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:08:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:08:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:08:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:08:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:08:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:08:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:08:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:08:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:08:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:08:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:08:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:08:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:08:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:08:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:08:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:08:14,801 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:08:14,801 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:08:14,801 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:08:14,801 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:08:14,801 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:08:14,801 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:08:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:08:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:08:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:08:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:08:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:08:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:08:14,802 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:08:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:08:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:08:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:08:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:08:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:08:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:08:14,803 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:08:14,804 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:08:14,804 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:08:14,804 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:08:14,804 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:08:14,804 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:08:14,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:08:14,804 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-10-14 22:08:14,805 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-10-14 22:08:14,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:08:14,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:08:14,805 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-10-14 22:08:14,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 22:08:14,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 22:08:14,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:08:14,806 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-10-14 22:08:14,806 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-10-14 22:08:14,806 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-10-14 22:08:14,806 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:08:14,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:08:14,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 22:08:14,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:08:14,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:08:15,619 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:08:15,619 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-10-14 22:08:15,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:08:15 BoogieIcfgContainer [2019-10-14 22:08:15,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:08:15,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:08:15,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:08:15,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:08:15,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:08:13" (1/3) ... [2019-10-14 22:08:15,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448c3825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:08:15, skipping insertion in model container [2019-10-14 22:08:15,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:14" (2/3) ... [2019-10-14 22:08:15,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448c3825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:08:15, skipping insertion in model container [2019-10-14 22:08:15,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:08:15" (3/3) ... [2019-10-14 22:08:15,630 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2019-10-14 22:08:15,658 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:08:15,669 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 22:08:15,683 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 22:08:15,721 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:08:15,721 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:08:15,721 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:08:15,721 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:08:15,721 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:08:15,722 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:08:15,722 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:08:15,722 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:08:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-10-14 22:08:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-14 22:08:15,748 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:15,749 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:15,751 INFO L410 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:15,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1873878464, now seen corresponding path program 1 times [2019-10-14 22:08:15,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:15,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085904607] [2019-10-14 22:08:15,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:15,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:15,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:15,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085904607] [2019-10-14 22:08:15,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:15,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 22:08:15,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443017018] [2019-10-14 22:08:15,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 22:08:15,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:15,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 22:08:15,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:08:15,988 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2019-10-14 22:08:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:16,286 INFO L93 Difference]: Finished difference Result 240 states and 408 transitions. [2019-10-14 22:08:16,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 22:08:16,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-14 22:08:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:16,302 INFO L225 Difference]: With dead ends: 240 [2019-10-14 22:08:16,302 INFO L226 Difference]: Without dead ends: 118 [2019-10-14 22:08:16,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:08:16,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-14 22:08:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2019-10-14 22:08:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-14 22:08:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-10-14 22:08:16,368 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 13 [2019-10-14 22:08:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:16,368 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-10-14 22:08:16,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 22:08:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-10-14 22:08:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 22:08:16,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:16,369 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:16,370 INFO L410 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:16,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:16,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1323314826, now seen corresponding path program 1 times [2019-10-14 22:08:16,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:16,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573643877] [2019-10-14 22:08:16,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:16,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:16,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:16,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573643877] [2019-10-14 22:08:16,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:16,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:08:16,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310472748] [2019-10-14 22:08:16,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:08:16,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:16,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:08:16,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:08:16,449 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 4 states. [2019-10-14 22:08:16,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:16,834 INFO L93 Difference]: Finished difference Result 206 states and 255 transitions. [2019-10-14 22:08:16,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:08:16,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-14 22:08:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:16,841 INFO L225 Difference]: With dead ends: 206 [2019-10-14 22:08:16,841 INFO L226 Difference]: Without dead ends: 115 [2019-10-14 22:08:16,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-14 22:08:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-14 22:08:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2019-10-14 22:08:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-14 22:08:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-10-14 22:08:16,875 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 14 [2019-10-14 22:08:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:16,876 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-10-14 22:08:16,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:08:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-10-14 22:08:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 22:08:16,877 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:16,877 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:16,877 INFO L410 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:16,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1684995551, now seen corresponding path program 1 times [2019-10-14 22:08:16,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:16,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900167194] [2019-10-14 22:08:16,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:16,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:16,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:17,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900167194] [2019-10-14 22:08:17,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:17,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 22:08:17,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197645036] [2019-10-14 22:08:17,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:08:17,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:17,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:08:17,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:08:17,070 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 7 states. [2019-10-14 22:08:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:17,712 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2019-10-14 22:08:17,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:08:17,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-14 22:08:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:17,715 INFO L225 Difference]: With dead ends: 157 [2019-10-14 22:08:17,715 INFO L226 Difference]: Without dead ends: 152 [2019-10-14 22:08:17,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:08:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-14 22:08:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 108. [2019-10-14 22:08:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-14 22:08:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2019-10-14 22:08:17,739 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 20 [2019-10-14 22:08:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:17,743 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2019-10-14 22:08:17,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:08:17,744 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2019-10-14 22:08:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 22:08:17,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:17,745 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:17,745 INFO L410 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:17,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:17,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1145945773, now seen corresponding path program 1 times [2019-10-14 22:08:17,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:17,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886799128] [2019-10-14 22:08:17,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:17,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:17,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:08:17,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886799128] [2019-10-14 22:08:17,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:17,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:08:17,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267737395] [2019-10-14 22:08:17,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:08:17,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:17,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:08:17,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:08:17,882 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2019-10-14 22:08:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:18,303 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2019-10-14 22:08:18,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:08:18,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-14 22:08:18,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:18,305 INFO L225 Difference]: With dead ends: 116 [2019-10-14 22:08:18,305 INFO L226 Difference]: Without dead ends: 113 [2019-10-14 22:08:18,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:08:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-14 22:08:18,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2019-10-14 22:08:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-14 22:08:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2019-10-14 22:08:18,318 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 27 [2019-10-14 22:08:18,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:18,318 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2019-10-14 22:08:18,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:08:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2019-10-14 22:08:18,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 22:08:18,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:18,319 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:18,320 INFO L410 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:18,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:18,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1471361763, now seen corresponding path program 1 times [2019-10-14 22:08:18,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:18,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161848440] [2019-10-14 22:08:18,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:18,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:18,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:08:18,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161848440] [2019-10-14 22:08:18,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:18,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:08:18,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309707693] [2019-10-14 22:08:18,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:08:18,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:18,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:08:18,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:08:18,462 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 6 states. [2019-10-14 22:08:18,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:18,875 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2019-10-14 22:08:18,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:08:18,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-14 22:08:18,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:18,877 INFO L225 Difference]: With dead ends: 115 [2019-10-14 22:08:18,878 INFO L226 Difference]: Without dead ends: 112 [2019-10-14 22:08:18,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:08:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-14 22:08:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2019-10-14 22:08:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-14 22:08:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2019-10-14 22:08:18,889 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 27 [2019-10-14 22:08:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:18,890 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2019-10-14 22:08:18,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:08:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2019-10-14 22:08:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 22:08:18,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:18,891 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:18,892 INFO L410 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:18,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1648323131, now seen corresponding path program 1 times [2019-10-14 22:08:18,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:18,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104582647] [2019-10-14 22:08:18,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:18,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:18,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:19,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104582647] [2019-10-14 22:08:19,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:19,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 22:08:19,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62219313] [2019-10-14 22:08:19,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 22:08:19,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:19,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 22:08:19,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:08:19,023 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand 8 states. [2019-10-14 22:08:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:19,759 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2019-10-14 22:08:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 22:08:19,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-10-14 22:08:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:19,761 INFO L225 Difference]: With dead ends: 147 [2019-10-14 22:08:19,761 INFO L226 Difference]: Without dead ends: 144 [2019-10-14 22:08:19,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:08:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-14 22:08:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 112. [2019-10-14 22:08:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-14 22:08:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2019-10-14 22:08:19,773 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 30 [2019-10-14 22:08:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:19,774 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2019-10-14 22:08:19,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 22:08:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2019-10-14 22:08:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 22:08:19,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:19,775 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:19,775 INFO L410 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:19,776 INFO L82 PathProgramCache]: Analyzing trace with hash 861386650, now seen corresponding path program 1 times [2019-10-14 22:08:19,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:19,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810739010] [2019-10-14 22:08:19,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:19,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:19,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:19,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810739010] [2019-10-14 22:08:19,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:19,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 22:08:19,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036537143] [2019-10-14 22:08:19,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 22:08:19,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:19,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 22:08:19,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:08:19,863 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand 8 states. [2019-10-14 22:08:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:20,453 INFO L93 Difference]: Finished difference Result 146 states and 175 transitions. [2019-10-14 22:08:20,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 22:08:20,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-10-14 22:08:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:20,455 INFO L225 Difference]: With dead ends: 146 [2019-10-14 22:08:20,456 INFO L226 Difference]: Without dead ends: 143 [2019-10-14 22:08:20,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:08:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-14 22:08:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2019-10-14 22:08:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-14 22:08:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2019-10-14 22:08:20,467 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 30 [2019-10-14 22:08:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:20,467 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2019-10-14 22:08:20,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 22:08:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2019-10-14 22:08:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 22:08:20,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:20,469 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:20,469 INFO L410 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:20,470 INFO L82 PathProgramCache]: Analyzing trace with hash 671486784, now seen corresponding path program 1 times [2019-10-14 22:08:20,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:20,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159288756] [2019-10-14 22:08:20,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:20,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:20,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:20,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159288756] [2019-10-14 22:08:20,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:20,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 22:08:20,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899883614] [2019-10-14 22:08:20,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 22:08:20,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:20,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 22:08:20,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:08:20,609 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 9 states. [2019-10-14 22:08:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:21,569 INFO L93 Difference]: Finished difference Result 150 states and 181 transitions. [2019-10-14 22:08:21,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:08:21,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-10-14 22:08:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:21,573 INFO L225 Difference]: With dead ends: 150 [2019-10-14 22:08:21,573 INFO L226 Difference]: Without dead ends: 147 [2019-10-14 22:08:21,573 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-14 22:08:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-14 22:08:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 121. [2019-10-14 22:08:21,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-14 22:08:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2019-10-14 22:08:21,584 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 33 [2019-10-14 22:08:21,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:21,584 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2019-10-14 22:08:21,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 22:08:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2019-10-14 22:08:21,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 22:08:21,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:21,586 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:21,586 INFO L410 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:21,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:21,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1082082582, now seen corresponding path program 1 times [2019-10-14 22:08:21,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:21,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140608783] [2019-10-14 22:08:21,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:21,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:21,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:21,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:21,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140608783] [2019-10-14 22:08:21,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:21,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 22:08:21,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398797152] [2019-10-14 22:08:21,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 22:08:21,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:21,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 22:08:21,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:08:21,720 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand 9 states. [2019-10-14 22:08:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:22,644 INFO L93 Difference]: Finished difference Result 149 states and 179 transitions. [2019-10-14 22:08:22,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:08:22,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-10-14 22:08:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:22,647 INFO L225 Difference]: With dead ends: 149 [2019-10-14 22:08:22,647 INFO L226 Difference]: Without dead ends: 146 [2019-10-14 22:08:22,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-14 22:08:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-14 22:08:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 124. [2019-10-14 22:08:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-14 22:08:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2019-10-14 22:08:22,657 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 33 [2019-10-14 22:08:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:22,657 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2019-10-14 22:08:22,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 22:08:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2019-10-14 22:08:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 22:08:22,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:22,659 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:22,659 INFO L410 AbstractCegarLoop]: === Iteration 10 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:22,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:22,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1572887273, now seen corresponding path program 1 times [2019-10-14 22:08:22,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:22,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650199115] [2019-10-14 22:08:22,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:22,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:22,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:08:22,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650199115] [2019-10-14 22:08:22,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:22,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:08:22,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286787229] [2019-10-14 22:08:22,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:08:22,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:22,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:08:22,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:08:22,746 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand 6 states. [2019-10-14 22:08:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:23,145 INFO L93 Difference]: Finished difference Result 132 states and 155 transitions. [2019-10-14 22:08:23,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:08:23,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-10-14 22:08:23,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:23,146 INFO L225 Difference]: With dead ends: 132 [2019-10-14 22:08:23,150 INFO L226 Difference]: Without dead ends: 128 [2019-10-14 22:08:23,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:08:23,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-14 22:08:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2019-10-14 22:08:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-14 22:08:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2019-10-14 22:08:23,161 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 38 [2019-10-14 22:08:23,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:23,162 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2019-10-14 22:08:23,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:08:23,162 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2019-10-14 22:08:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-14 22:08:23,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:23,167 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:23,168 INFO L410 AbstractCegarLoop]: === Iteration 11 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:23,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:23,168 INFO L82 PathProgramCache]: Analyzing trace with hash 235623500, now seen corresponding path program 1 times [2019-10-14 22:08:23,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:23,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414634010] [2019-10-14 22:08:23,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:23,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:23,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:23,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414634010] [2019-10-14 22:08:23,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:23,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 22:08:23,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727586873] [2019-10-14 22:08:23,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 22:08:23,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:23,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 22:08:23,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:08:23,295 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand 8 states. [2019-10-14 22:08:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:23,897 INFO L93 Difference]: Finished difference Result 158 states and 186 transitions. [2019-10-14 22:08:23,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:08:23,898 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-10-14 22:08:23,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:23,899 INFO L225 Difference]: With dead ends: 158 [2019-10-14 22:08:23,899 INFO L226 Difference]: Without dead ends: 155 [2019-10-14 22:08:23,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:08:23,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-14 22:08:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 127. [2019-10-14 22:08:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-14 22:08:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 147 transitions. [2019-10-14 22:08:23,910 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 147 transitions. Word has length 41 [2019-10-14 22:08:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:23,910 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 147 transitions. [2019-10-14 22:08:23,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 22:08:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 147 transitions. [2019-10-14 22:08:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-14 22:08:23,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:23,912 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:23,912 INFO L410 AbstractCegarLoop]: === Iteration 12 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:23,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1351973035, now seen corresponding path program 1 times [2019-10-14 22:08:23,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:23,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482079785] [2019-10-14 22:08:23,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:23,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:23,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:24,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482079785] [2019-10-14 22:08:24,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428317486] [2019-10-14 22:08:24,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:24,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-14 22:08:24,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:24,376 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 14 treesize of output 15 [2019-10-14 22:08:24,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,399 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 14 treesize of output 15 [2019-10-14 22:08:24,400 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:18 [2019-10-14 22:08:24,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:08:24,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:08:24,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,511 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-14 22:08:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:24,525 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:24,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-10-14 22:08:24,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361808657] [2019-10-14 22:08:24,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 22:08:24,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:24,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 22:08:24,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:08:24,527 INFO L87 Difference]: Start difference. First operand 127 states and 147 transitions. Second operand 12 states. [2019-10-14 22:08:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:25,795 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2019-10-14 22:08:25,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 22:08:25,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-10-14 22:08:25,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:25,799 INFO L225 Difference]: With dead ends: 271 [2019-10-14 22:08:25,800 INFO L226 Difference]: Without dead ends: 268 [2019-10-14 22:08:25,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-14 22:08:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-10-14 22:08:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 195. [2019-10-14 22:08:25,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-14 22:08:25,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 223 transitions. [2019-10-14 22:08:25,819 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 223 transitions. Word has length 44 [2019-10-14 22:08:25,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:25,820 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 223 transitions. [2019-10-14 22:08:25,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 22:08:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 223 transitions. [2019-10-14 22:08:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-14 22:08:25,821 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:25,821 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:26,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:26,026 INFO L410 AbstractCegarLoop]: === Iteration 13 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:26,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1255057270, now seen corresponding path program 1 times [2019-10-14 22:08:26,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:26,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156413981] [2019-10-14 22:08:26,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:26,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:26,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:26,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156413981] [2019-10-14 22:08:26,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939523978] [2019-10-14 22:08:26,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:26,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-14 22:08:26,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:26,464 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 14 treesize of output 15 [2019-10-14 22:08:26,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:26,479 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 14 treesize of output 15 [2019-10-14 22:08:26,480 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:26,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,493 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:18 [2019-10-14 22:08:26,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:08:26,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:26,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:08:26,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:26,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,530 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-14 22:08:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:26,552 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:26,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2019-10-14 22:08:26,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323113492] [2019-10-14 22:08:26,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 22:08:26,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:26,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 22:08:26,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:08:26,554 INFO L87 Difference]: Start difference. First operand 195 states and 223 transitions. Second operand 12 states. [2019-10-14 22:08:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:27,420 INFO L93 Difference]: Finished difference Result 269 states and 315 transitions. [2019-10-14 22:08:27,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:08:27,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-10-14 22:08:27,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:27,423 INFO L225 Difference]: With dead ends: 269 [2019-10-14 22:08:27,423 INFO L226 Difference]: Without dead ends: 170 [2019-10-14 22:08:27,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-14 22:08:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-14 22:08:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2019-10-14 22:08:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-14 22:08:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2019-10-14 22:08:27,445 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 44 [2019-10-14 22:08:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:27,446 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2019-10-14 22:08:27,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 22:08:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2019-10-14 22:08:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 22:08:27,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:27,447 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:27,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:27,651 INFO L410 AbstractCegarLoop]: === Iteration 14 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:27,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1691394343, now seen corresponding path program 1 times [2019-10-14 22:08:27,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:27,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101587188] [2019-10-14 22:08:27,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:27,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:27,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:08:27,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101587188] [2019-10-14 22:08:27,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:27,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-14 22:08:27,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231102311] [2019-10-14 22:08:27,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 22:08:27,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:27,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 22:08:27,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-14 22:08:27,853 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand 11 states. [2019-10-14 22:08:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:28,741 INFO L93 Difference]: Finished difference Result 196 states and 226 transitions. [2019-10-14 22:08:28,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:08:28,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2019-10-14 22:08:28,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:28,743 INFO L225 Difference]: With dead ends: 196 [2019-10-14 22:08:28,743 INFO L226 Difference]: Without dead ends: 193 [2019-10-14 22:08:28,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-10-14 22:08:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-14 22:08:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 175. [2019-10-14 22:08:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-14 22:08:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 199 transitions. [2019-10-14 22:08:28,758 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 199 transitions. Word has length 47 [2019-10-14 22:08:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:28,758 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 199 transitions. [2019-10-14 22:08:28,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 22:08:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 199 transitions. [2019-10-14 22:08:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 22:08:28,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:28,759 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:28,760 INFO L410 AbstractCegarLoop]: === Iteration 15 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:28,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:28,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1821749989, now seen corresponding path program 1 times [2019-10-14 22:08:28,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:28,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304915673] [2019-10-14 22:08:28,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:28,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:28,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:28,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304915673] [2019-10-14 22:08:28,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:28,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 22:08:28,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924560023] [2019-10-14 22:08:28,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 22:08:28,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:28,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 22:08:28,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:08:28,873 INFO L87 Difference]: Start difference. First operand 175 states and 199 transitions. Second operand 9 states. [2019-10-14 22:08:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:29,569 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2019-10-14 22:08:29,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:08:29,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-10-14 22:08:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:29,572 INFO L225 Difference]: With dead ends: 237 [2019-10-14 22:08:29,573 INFO L226 Difference]: Without dead ends: 187 [2019-10-14 22:08:29,574 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-10-14 22:08:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-14 22:08:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2019-10-14 22:08:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-14 22:08:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2019-10-14 22:08:29,590 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 50 [2019-10-14 22:08:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:29,590 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2019-10-14 22:08:29,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 22:08:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2019-10-14 22:08:29,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-14 22:08:29,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:29,592 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:29,592 INFO L410 AbstractCegarLoop]: === Iteration 16 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:29,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:29,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1200260978, now seen corresponding path program 1 times [2019-10-14 22:08:29,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:29,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693587616] [2019-10-14 22:08:29,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:29,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:29,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:08:29,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693587616] [2019-10-14 22:08:29,727 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:29,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-14 22:08:29,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047714322] [2019-10-14 22:08:29,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 22:08:29,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:29,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 22:08:29,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-14 22:08:29,729 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand 13 states. [2019-10-14 22:08:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:30,879 INFO L93 Difference]: Finished difference Result 220 states and 261 transitions. [2019-10-14 22:08:30,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 22:08:30,880 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-10-14 22:08:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:30,884 INFO L225 Difference]: With dead ends: 220 [2019-10-14 22:08:30,885 INFO L226 Difference]: Without dead ends: 217 [2019-10-14 22:08:30,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-10-14 22:08:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-14 22:08:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 191. [2019-10-14 22:08:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-14 22:08:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 225 transitions. [2019-10-14 22:08:30,902 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 225 transitions. Word has length 51 [2019-10-14 22:08:30,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:30,903 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 225 transitions. [2019-10-14 22:08:30,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 22:08:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 225 transitions. [2019-10-14 22:08:30,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 22:08:30,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:30,905 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:30,905 INFO L410 AbstractCegarLoop]: === Iteration 17 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:30,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:30,905 INFO L82 PathProgramCache]: Analyzing trace with hash 629786452, now seen corresponding path program 2 times [2019-10-14 22:08:30,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:30,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733831070] [2019-10-14 22:08:30,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:30,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:30,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:31,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733831070] [2019-10-14 22:08:31,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801329631] [2019-10-14 22:08:31,201 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:31,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-14 22:08:31,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:31,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-14 22:08:31,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:31,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-14 22:08:31,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-14 22:08:31,420 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,426 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-10-14 22:08:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 22:08:31,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 22:08:31,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2019-10-14 22:08:31,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004098493] [2019-10-14 22:08:31,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:08:31,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:31,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:08:31,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:08:31,451 INFO L87 Difference]: Start difference. First operand 191 states and 225 transitions. Second operand 7 states. [2019-10-14 22:08:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:31,777 INFO L93 Difference]: Finished difference Result 193 states and 226 transitions. [2019-10-14 22:08:31,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:08:31,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-10-14 22:08:31,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:31,780 INFO L225 Difference]: With dead ends: 193 [2019-10-14 22:08:31,780 INFO L226 Difference]: Without dead ends: 190 [2019-10-14 22:08:31,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-10-14 22:08:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-14 22:08:31,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2019-10-14 22:08:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-14 22:08:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 213 transitions. [2019-10-14 22:08:31,803 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 213 transitions. Word has length 50 [2019-10-14 22:08:31,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:31,803 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 213 transitions. [2019-10-14 22:08:31,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:08:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 213 transitions. [2019-10-14 22:08:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 22:08:31,805 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:31,805 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:32,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:32,009 INFO L410 AbstractCegarLoop]: === Iteration 18 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:32,010 INFO L82 PathProgramCache]: Analyzing trace with hash 532870687, now seen corresponding path program 2 times [2019-10-14 22:08:32,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:32,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543883529] [2019-10-14 22:08:32,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:32,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:32,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:32,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543883529] [2019-10-14 22:08:32,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936827950] [2019-10-14 22:08:32,521 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:32,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:08:32,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:32,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-14 22:08:32,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:32,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:32,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2019-10-14 22:08:32,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2019-10-14 22:08:32,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2019-10-14 22:08:32,773 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,773 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-10-14 22:08:32,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2019-10-14 22:08:32,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:32,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-10-14 22:08:32,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,892 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.9 percent of original size [2019-10-14 22:08:32,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:29 [2019-10-14 22:08:32,932 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_56|], 3=[|v_#memory_$Pointer$.base_58|]} [2019-10-14 22:08:32,946 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 14 treesize of output 15 [2019-10-14 22:08:32,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 76 [2019-10-14 22:08:32,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:32,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:32,996 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,055 INFO L567 ElimStorePlain]: treesize reduction 41, result has 59.4 percent of original size [2019-10-14 22:08:33,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,056 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:69 [2019-10-14 22:08:33,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:33,220 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 72 treesize of output 60 [2019-10-14 22:08:33,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,225 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 68 treesize of output 56 [2019-10-14 22:08:33,226 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,290 INFO L567 ElimStorePlain]: treesize reduction 12, result has 88.6 percent of original size [2019-10-14 22:08:33,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-14 22:08:33,292 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:141, output treesize:93 [2019-10-14 22:08:33,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:33,390 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.base|], 3=[v_prenex_3]} [2019-10-14 22:08:33,397 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:33,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 30 [2019-10-14 22:08:33,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:33,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:33,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:33,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 45 [2019-10-14 22:08:33,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:33,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:33,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:33,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:33,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:33,431 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,440 INFO L567 ElimStorePlain]: treesize reduction 10, result has 28.6 percent of original size [2019-10-14 22:08:33,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,441 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:4 [2019-10-14 22:08:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:33,464 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:33,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2019-10-14 22:08:33,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486987786] [2019-10-14 22:08:33,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-14 22:08:33,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:33,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-14 22:08:33,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2019-10-14 22:08:33,466 INFO L87 Difference]: Start difference. First operand 182 states and 213 transitions. Second operand 25 states. [2019-10-14 22:08:34,496 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-10-14 22:08:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:36,733 INFO L93 Difference]: Finished difference Result 237 states and 288 transitions. [2019-10-14 22:08:36,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 22:08:36,734 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-10-14 22:08:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:36,736 INFO L225 Difference]: With dead ends: 237 [2019-10-14 22:08:36,736 INFO L226 Difference]: Without dead ends: 234 [2019-10-14 22:08:36,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2019-10-14 22:08:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-14 22:08:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 193. [2019-10-14 22:08:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-14 22:08:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2019-10-14 22:08:36,758 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 50 [2019-10-14 22:08:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:36,758 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2019-10-14 22:08:36,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-14 22:08:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2019-10-14 22:08:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 22:08:36,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:36,760 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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] [2019-10-14 22:08:36,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:36,970 INFO L410 AbstractCegarLoop]: === Iteration 19 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:36,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:36,971 INFO L82 PathProgramCache]: Analyzing trace with hash -254065794, now seen corresponding path program 1 times [2019-10-14 22:08:36,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:36,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511589163] [2019-10-14 22:08:36,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:36,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:36,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:37,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511589163] [2019-10-14 22:08:37,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255727426] [2019-10-14 22:08:37,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:37,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-14 22:08:37,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:37,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:37,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:37,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:08:37,601 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 14 treesize of output 15 [2019-10-14 22:08:37,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:37,618 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 14 treesize of output 15 [2019-10-14 22:08:37,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:37,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,635 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-10-14 22:08:37,685 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:37,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:08:37,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,714 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-10-14 22:08:37,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:32 [2019-10-14 22:08:37,765 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:37,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 22:08:37,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:37,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:37,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-10-14 22:08:37,796 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:37,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:37,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-10-14 22:08:37,831 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:37,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,850 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:84, output treesize:47 [2019-10-14 22:08:37,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-10-14 22:08:37,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:37,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-10-14 22:08:37,947 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:37,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,974 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:91 [2019-10-14 22:08:38,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:38,229 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:38,310 INFO L341 Elim1Store]: treesize reduction 8, result has 91.1 percent of original size [2019-10-14 22:08:38,310 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 7 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 140 [2019-10-14 22:08:38,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:38,336 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:38,377 INFO L567 ElimStorePlain]: treesize reduction 62, result has 46.6 percent of original size [2019-10-14 22:08:38,384 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:38,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2019-10-14 22:08:38,385 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:38,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:38,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:38,397 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:122, output treesize:7 [2019-10-14 22:08:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:38,458 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:38,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2019-10-14 22:08:38,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004583823] [2019-10-14 22:08:38,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-14 22:08:38,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:38,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-14 22:08:38,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-14 22:08:38,464 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand 25 states. [2019-10-14 22:08:39,703 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-10-14 22:08:40,058 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-10-14 22:08:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:43,139 INFO L93 Difference]: Finished difference Result 395 states and 482 transitions. [2019-10-14 22:08:43,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-14 22:08:43,140 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-10-14 22:08:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:43,142 INFO L225 Difference]: With dead ends: 395 [2019-10-14 22:08:43,142 INFO L226 Difference]: Without dead ends: 294 [2019-10-14 22:08:43,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=222, Invalid=1758, Unknown=0, NotChecked=0, Total=1980 [2019-10-14 22:08:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-14 22:08:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 253. [2019-10-14 22:08:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-14 22:08:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 288 transitions. [2019-10-14 22:08:43,165 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 288 transitions. Word has length 50 [2019-10-14 22:08:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:43,166 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 288 transitions. [2019-10-14 22:08:43,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-14 22:08:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 288 transitions. [2019-10-14 22:08:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-14 22:08:43,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:43,167 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 22:08:43,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:43,371 INFO L410 AbstractCegarLoop]: === Iteration 20 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:43,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash -596228507, now seen corresponding path program 1 times [2019-10-14 22:08:43,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:43,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252043768] [2019-10-14 22:08:43,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:43,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:43,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:08:43,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252043768] [2019-10-14 22:08:43,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:43,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:08:43,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382408251] [2019-10-14 22:08:43,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:08:43,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:43,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:08:43,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:08:43,441 INFO L87 Difference]: Start difference. First operand 253 states and 288 transitions. Second operand 6 states. [2019-10-14 22:08:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:43,808 INFO L93 Difference]: Finished difference Result 258 states and 294 transitions. [2019-10-14 22:08:43,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:08:43,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-14 22:08:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:43,811 INFO L225 Difference]: With dead ends: 258 [2019-10-14 22:08:43,811 INFO L226 Difference]: Without dead ends: 239 [2019-10-14 22:08:43,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:08:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-10-14 22:08:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-10-14 22:08:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-14 22:08:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 268 transitions. [2019-10-14 22:08:43,831 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 268 transitions. Word has length 53 [2019-10-14 22:08:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:43,831 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 268 transitions. [2019-10-14 22:08:43,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:08:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 268 transitions. [2019-10-14 22:08:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-14 22:08:43,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:43,833 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:43,833 INFO L410 AbstractCegarLoop]: === Iteration 21 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:43,833 INFO L82 PathProgramCache]: Analyzing trace with hash 389696732, now seen corresponding path program 1 times [2019-10-14 22:08:43,833 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:43,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111569215] [2019-10-14 22:08:43,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:43,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:43,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:44,313 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-10-14 22:08:44,826 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2019-10-14 22:08:45,023 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 32 [2019-10-14 22:08:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:45,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111569215] [2019-10-14 22:08:45,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133762720] [2019-10-14 22:08:45,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:45,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 85 conjunts are in the unsatisfiable core [2019-10-14 22:08:45,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:45,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:45,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:45,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:45,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:45,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 22:08:45,538 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:45,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:08:45,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:45,585 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.3 percent of original size [2019-10-14 22:08:45,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:45,593 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 22 treesize of output 7 [2019-10-14 22:08:45,593 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:45,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:45,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:45,612 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 22 treesize of output 7 [2019-10-14 22:08:45,613 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:45,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:45,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:45,628 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:67, output treesize:35 [2019-10-14 22:08:45,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-10-14 22:08:45,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:45,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:45,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-10-14 22:08:45,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:45,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:45,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:45,686 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:55 [2019-10-14 22:08:45,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:45,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 22:08:45,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:45,839 INFO L567 ElimStorePlain]: treesize reduction 40, result has 65.2 percent of original size [2019-10-14 22:08:45,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:45,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:75 [2019-10-14 22:08:45,923 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:45,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 41 [2019-10-14 22:08:45,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:45,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:45,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:45,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-10-14 22:08:45,974 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:46,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:46,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:46,031 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:46,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 71 [2019-10-14 22:08:46,033 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:46,106 INFO L567 ElimStorePlain]: treesize reduction 44, result has 66.9 percent of original size [2019-10-14 22:08:46,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:46,107 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:127, output treesize:89 [2019-10-14 22:08:46,199 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:46,199 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 3 case distinctions, treesize of input 68 treesize of output 96 [2019-10-14 22:08:46,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:46,290 INFO L567 ElimStorePlain]: treesize reduction 48, result has 69.0 percent of original size [2019-10-14 22:08:46,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:46,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 49 [2019-10-14 22:08:46,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:46,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:46,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:46,341 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:145 [2019-10-14 22:08:47,091 INFO L392 ElimStorePlain]: Different costs {28=[|#memory_$Pointer$.offset|], 42=[|#memory_$Pointer$.base|]} [2019-10-14 22:08:47,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:47,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:47,158 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:47,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 7 case distinctions, treesize of input 131 treesize of output 164 [2019-10-14 22:08:47,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:47,224 INFO L567 ElimStorePlain]: treesize reduction 56, result has 66.7 percent of original size [2019-10-14 22:08:47,264 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:47,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 109 treesize of output 98 [2019-10-14 22:08:47,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:47,278 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:47,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:47,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:47,285 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:213, output treesize:7 [2019-10-14 22:08:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:47,328 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:47,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-10-14 22:08:47,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823709916] [2019-10-14 22:08:47,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-14 22:08:47,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:47,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-14 22:08:47,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2019-10-14 22:08:47,329 INFO L87 Difference]: Start difference. First operand 236 states and 268 transitions. Second operand 27 states. [2019-10-14 22:08:47,624 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-10-14 22:08:48,062 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-10-14 22:08:48,732 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-10-14 22:08:49,451 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 94