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-data/packet_filter.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 02:00:26,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 02:00:26,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 02:00:26,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 02:00:26,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 02:00:26,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 02:00:26,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 02:00:26,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 02:00:26,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 02:00:26,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 02:00:26,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 02:00:26,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 02:00:26,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 02:00:26,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 02:00:26,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 02:00:26,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 02:00:26,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 02:00:26,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 02:00:26,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 02:00:26,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 02:00:26,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 02:00:26,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 02:00:26,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 02:00:26,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 02:00:26,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 02:00:26,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 02:00:26,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 02:00:26,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 02:00:26,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 02:00:26,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 02:00:26,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 02:00:26,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 02:00:26,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 02:00:26,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 02:00:26,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 02:00:26,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 02:00:26,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 02:00:26,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 02:00:26,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 02:00:26,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 02:00:26,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 02:00:26,877 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-02 02:00:26,895 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 02:00:26,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 02:00:26,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 02:00:26,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 02:00:26,897 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 02:00:26,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 02:00:26,897 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 02:00:26,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 02:00:26,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 02:00:26,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 02:00:26,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 02:00:26,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 02:00:26,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 02:00:26,899 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 02:00:26,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 02:00:26,899 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 02:00:26,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 02:00:26,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 02:00:26,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 02:00:26,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 02:00:26,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 02:00:26,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 02:00:26,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 02:00:26,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 02:00:26,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 02:00:26,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 02:00:26,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 02:00:26,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 02:00:26,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 02:00:26,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 02:00:26,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 02:00:26,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 02:00:26,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 02:00:26,952 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 02:00:26,953 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/packet_filter.i [2019-10-02 02:00:27,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09ddda82/da93dfda66654e7987e1578478913708/FLAG4825d1060 [2019-10-02 02:00:27,588 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 02:00:27,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/packet_filter.i [2019-10-02 02:00:27,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09ddda82/da93dfda66654e7987e1578478913708/FLAG4825d1060 [2019-10-02 02:00:27,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09ddda82/da93dfda66654e7987e1578478913708 [2019-10-02 02:00:27,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 02:00:27,923 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 02:00:27,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 02:00:27,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 02:00:27,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 02:00:27,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:00:27" (1/1) ... [2019-10-02 02:00:27,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7189696a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:27, skipping insertion in model container [2019-10-02 02:00:27,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:00:27" (1/1) ... [2019-10-02 02:00:27,935 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 02:00:27,977 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 02:00:28,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 02:00:28,461 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 02:00:28,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 02:00:28,585 INFO L192 MainTranslator]: Completed translation [2019-10-02 02:00:28,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:28 WrapperNode [2019-10-02 02:00:28,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 02:00:28,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 02:00:28,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 02:00:28,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 02:00:28,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:28" (1/1) ... [2019-10-02 02:00:28,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:28" (1/1) ... [2019-10-02 02:00:28,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:28" (1/1) ... [2019-10-02 02:00:28,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:28" (1/1) ... [2019-10-02 02:00:28,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:28" (1/1) ... [2019-10-02 02:00:28,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:28" (1/1) ... [2019-10-02 02:00:28,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:28" (1/1) ... [2019-10-02 02:00:28,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 02:00:28,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 02:00:28,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 02:00:28,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 02:00:28,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:28" (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-02 02:00:28,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 02:00:28,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 02:00:28,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 02:00:28,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 02:00:28,732 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2019-10-02 02:00:28,732 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2019-10-02 02:00:28,732 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2019-10-02 02:00:28,732 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2019-10-02 02:00:28,732 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2019-10-02 02:00:28,732 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 02:00:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-02 02:00:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 02:00:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2019-10-02 02:00:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 02:00:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 02:00:28,734 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 02:00:28,734 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 02:00:28,734 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 02:00:28,734 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 02:00:28,734 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 02:00:28,735 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 02:00:28,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 02:00:28,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 02:00:28,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 02:00:28,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 02:00:28,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 02:00:28,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 02:00:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 02:00:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 02:00:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 02:00:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 02:00:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 02:00:28,737 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 02:00:28,737 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 02:00:28,737 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 02:00:28,737 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 02:00:28,737 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 02:00:28,737 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 02:00:28,737 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 02:00:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 02:00:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 02:00:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 02:00:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 02:00:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 02:00:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 02:00:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 02:00:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 02:00:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 02:00:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 02:00:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 02:00:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 02:00:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 02:00:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 02:00:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 02:00:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 02:00:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 02:00:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 02:00:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 02:00:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 02:00:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 02:00:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 02:00:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 02:00:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 02:00:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 02:00:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 02:00:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 02:00:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 02:00:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 02:00:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 02:00:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 02:00:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 02:00:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 02:00:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 02:00:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 02:00:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 02:00:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 02:00:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 02:00:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 02:00:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 02:00:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 02:00:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 02:00:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 02:00:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 02:00:28,745 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 02:00:28,745 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 02:00:28,745 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 02:00:28,745 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 02:00:28,745 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 02:00:28,745 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 02:00:28,745 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 02:00:28,746 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 02:00:28,746 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 02:00:28,746 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 02:00:28,746 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 02:00:28,746 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 02:00:28,746 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 02:00:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 02:00:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 02:00:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 02:00:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 02:00:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 02:00:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 02:00:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 02:00:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 02:00:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 02:00:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 02:00:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 02:00:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 02:00:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 02:00:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 02:00:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 02:00:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 02:00:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 02:00:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 02:00:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 02:00:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 02:00:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 02:00:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 02:00:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 02:00:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2019-10-02 02:00:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 02:00:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 02:00:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 02:00:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 02:00:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 02:00:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 02:00:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure send [2019-10-02 02:00:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2019-10-02 02:00:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 02:00:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2019-10-02 02:00:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2019-10-02 02:00:28,752 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 02:00:28,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 02:00:28,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 02:00:28,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 02:00:28,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 02:00:29,432 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 02:00:29,433 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 02:00:29,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:00:29 BoogieIcfgContainer [2019-10-02 02:00:29,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 02:00:29,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 02:00:29,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 02:00:29,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 02:00:29,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:00:27" (1/3) ... [2019-10-02 02:00:29,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131e584c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:00:29, skipping insertion in model container [2019-10-02 02:00:29,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:00:28" (2/3) ... [2019-10-02 02:00:29,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131e584c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:00:29, skipping insertion in model container [2019-10-02 02:00:29,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:00:29" (3/3) ... [2019-10-02 02:00:29,445 INFO L109 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2019-10-02 02:00:29,455 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 02:00:29,464 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-02 02:00:29,482 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-02 02:00:29,515 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 02:00:29,516 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 02:00:29,517 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 02:00:29,517 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 02:00:29,517 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 02:00:29,517 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 02:00:29,518 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 02:00:29,518 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 02:00:29,518 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 02:00:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-10-02 02:00:29,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 02:00:29,546 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:00:29,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:00:29,549 INFO L418 AbstractCegarLoop]: === Iteration 1 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:00:29,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:00:29,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1068933411, now seen corresponding path program 1 times [2019-10-02 02:00:29,558 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:00:29,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:00:29,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:29,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:00:29,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:00:29,720 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-02 02:00:29,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 02:00:29,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 02:00:29,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 02:00:29,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 02:00:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 02:00:29,746 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2019-10-02 02:00:29,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:00:29,776 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2019-10-02 02:00:29,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 02:00:29,778 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-02 02:00:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:00:29,789 INFO L225 Difference]: With dead ends: 100 [2019-10-02 02:00:29,789 INFO L226 Difference]: Without dead ends: 57 [2019-10-02 02:00:29,793 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 02:00:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-02 02:00:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-02 02:00:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-02 02:00:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2019-10-02 02:00:29,843 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 14 [2019-10-02 02:00:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:00:29,843 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2019-10-02 02:00:29,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 02:00:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2019-10-02 02:00:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 02:00:29,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:00:29,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:00:29,845 INFO L418 AbstractCegarLoop]: === Iteration 2 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:00:29,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:00:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1316192133, now seen corresponding path program 1 times [2019-10-02 02:00:29,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:00:29,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:00:29,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:29,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:00:29,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:00:29,936 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-02 02:00:29,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 02:00:29,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 02:00:29,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 02:00:29,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 02:00:29,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 02:00:29,940 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 3 states. [2019-10-02 02:00:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:00:29,974 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-10-02 02:00:29,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 02:00:29,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-02 02:00:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:00:29,976 INFO L225 Difference]: With dead ends: 60 [2019-10-02 02:00:29,977 INFO L226 Difference]: Without dead ends: 58 [2019-10-02 02:00:29,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 02:00:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-02 02:00:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-02 02:00:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-02 02:00:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-10-02 02:00:29,988 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 15 [2019-10-02 02:00:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:00:29,988 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-10-02 02:00:29,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 02:00:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-10-02 02:00:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 02:00:29,989 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:00:29,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:00:29,990 INFO L418 AbstractCegarLoop]: === Iteration 3 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:00:29,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:00:29,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1316190211, now seen corresponding path program 1 times [2019-10-02 02:00:29,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:00:29,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:00:29,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:29,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:00:29,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:00:30,146 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-02 02:00:30,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 02:00:30,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 02:00:30,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 02:00:30,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 02:00:30,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 02:00:30,147 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2019-10-02 02:00:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:00:30,313 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2019-10-02 02:00:30,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 02:00:30,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-02 02:00:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:00:30,317 INFO L225 Difference]: With dead ends: 95 [2019-10-02 02:00:30,317 INFO L226 Difference]: Without dead ends: 68 [2019-10-02 02:00:30,317 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 02:00:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-02 02:00:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-02 02:00:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-02 02:00:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2019-10-02 02:00:30,330 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 15 [2019-10-02 02:00:30,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:00:30,330 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2019-10-02 02:00:30,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 02:00:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2019-10-02 02:00:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 02:00:30,331 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:00:30,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:00:30,332 INFO L418 AbstractCegarLoop]: === Iteration 4 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:00:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:00:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1729106577, now seen corresponding path program 1 times [2019-10-02 02:00:30,332 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:00:30,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:00:30,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:30,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:00:30,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:00:30,488 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-02 02:00:30,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 02:00:30,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 02:00:30,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 02:00:30,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 02:00:30,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 02:00:30,490 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2019-10-02 02:00:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:00:30,968 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2019-10-02 02:00:30,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 02:00:30,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-10-02 02:00:30,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:00:30,970 INFO L225 Difference]: With dead ends: 100 [2019-10-02 02:00:30,970 INFO L226 Difference]: Without dead ends: 78 [2019-10-02 02:00:30,970 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 02:00:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-02 02:00:30,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2019-10-02 02:00:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-02 02:00:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2019-10-02 02:00:30,980 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 21 [2019-10-02 02:00:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:00:30,980 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2019-10-02 02:00:30,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 02:00:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2019-10-02 02:00:30,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 02:00:30,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:00:30,982 INFO L411 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] [2019-10-02 02:00:30,982 INFO L418 AbstractCegarLoop]: === Iteration 5 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:00:30,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:00:30,983 INFO L82 PathProgramCache]: Analyzing trace with hash 453892566, now seen corresponding path program 1 times [2019-10-02 02:00:30,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:00:30,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:00:30,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:30,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:00:30,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:00:31,461 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-10-02 02:00:31,559 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-02 02:00:31,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:00:31,560 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:00:31,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:00:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:00:31,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-02 02:00:31,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:00:31,826 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-02 02:00:31,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 02:00:31,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:31,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:31,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:00:31,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-10-02 02:00:31,946 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:31,947 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 22 treesize of output 69 [2019-10-02 02:00:31,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:32,010 INFO L567 ElimStorePlain]: treesize reduction 28, result has 60.0 percent of original size [2019-10-02 02:00:32,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 02:00:32,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:42 [2019-10-02 02:00:32,214 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:00:32,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:32,256 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:00:32,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:32,285 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:00:32,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:32,310 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:00:32,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:32,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-10-02 02:00:32,327 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2019-10-02 02:00:36,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:36,476 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 21 treesize of output 37 [2019-10-02 02:00:36,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:36,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:36,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:36,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:36,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:36,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2019-10-02 02:00:36,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:36,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:36,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:36,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:36,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:36,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2019-10-02 02:00:36,601 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:36,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:36,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:00:36,638 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:89, output treesize:15 [2019-10-02 02:00:36,646 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-02 02:00:36,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:36,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:36,657 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-02 02:00:36,657 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:36,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:36,662 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-02 02:00:36,662 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-10-02 02:00:36,668 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-02 02:00:36,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:00:36,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 14 [2019-10-02 02:00:36,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 02:00:36,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 02:00:36,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=144, Unknown=2, NotChecked=0, Total=182 [2019-10-02 02:00:36,679 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 14 states. [2019-10-02 02:00:40,984 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-02 02:00:47,310 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-10-02 02:01:06,410 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-10-02 02:01:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:01:06,747 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2019-10-02 02:01:06,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 02:01:06,748 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-10-02 02:01:06,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:01:06,750 INFO L225 Difference]: With dead ends: 145 [2019-10-02 02:01:06,750 INFO L226 Difference]: Without dead ends: 118 [2019-10-02 02:01:06,751 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=78, Invalid=337, Unknown=5, NotChecked=0, Total=420 [2019-10-02 02:01:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-02 02:01:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 72. [2019-10-02 02:01:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-02 02:01:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2019-10-02 02:01:06,764 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 26 [2019-10-02 02:01:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:01:06,764 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2019-10-02 02:01:06,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 02:01:06,765 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2019-10-02 02:01:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 02:01:06,766 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:01:06,766 INFO L411 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] [2019-10-02 02:01:06,767 INFO L418 AbstractCegarLoop]: === Iteration 6 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:01:06,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:01:06,767 INFO L82 PathProgramCache]: Analyzing trace with hash -845629304, now seen corresponding path program 1 times [2019-10-02 02:01:06,767 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:01:06,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:01:06,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:06,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:06,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:07,132 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-10-02 02:01:07,218 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-02 02:01:07,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:01:07,218 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:01:07,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:07,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-02 02:01:07,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:01:07,372 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-02 02:01:07,373 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-02 02:01:07,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:07,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:07,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:01:07,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2019-10-02 02:01:07,402 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:07,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-10-02 02:01:07,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:07,448 INFO L567 ElimStorePlain]: treesize reduction 14, result has 64.1 percent of original size [2019-10-02 02:01:07,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:01:07,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2019-10-02 02:01:07,500 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:01:07,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:07,538 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:01:07,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:07,565 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:01:07,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:07,589 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:01:07,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:07,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-10-02 02:01:07,607 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2019-10-02 02:01:11,718 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:11,719 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-02 02:01:11,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:11,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:11,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:01:11,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:01:11,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:01:11,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2019-10-02 02:01:11,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:11,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:11,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:01:11,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:01:11,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:01:11,782 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 29 treesize of output 36 [2019-10-02 02:01:11,783 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:11,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:11,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:01:11,805 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:67, output treesize:15 [2019-10-02 02:01:11,825 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-02 02:01:11,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:11,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:11,834 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-02 02:01:11,834 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:11,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:11,840 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-02 02:01:11,840 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-10-02 02:01:11,845 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-02 02:01:11,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:01:11,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2019-10-02 02:01:11,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 02:01:11,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 02:01:11,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=145, Unknown=2, NotChecked=0, Total=182 [2019-10-02 02:01:11,850 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 14 states. [2019-10-02 02:01:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:01:43,622 INFO L93 Difference]: Finished difference Result 132 states and 163 transitions. [2019-10-02 02:01:43,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 02:01:43,623 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-10-02 02:01:43,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:01:43,625 INFO L225 Difference]: With dead ends: 132 [2019-10-02 02:01:43,625 INFO L226 Difference]: Without dead ends: 110 [2019-10-02 02:01:43,626 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=67, Invalid=272, Unknown=3, NotChecked=0, Total=342 [2019-10-02 02:01:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-02 02:01:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 66. [2019-10-02 02:01:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-02 02:01:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2019-10-02 02:01:43,648 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 32 [2019-10-02 02:01:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:01:43,649 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2019-10-02 02:01:43,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 02:01:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2019-10-02 02:01:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 02:01:43,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:01:43,650 INFO L411 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] [2019-10-02 02:01:43,650 INFO L418 AbstractCegarLoop]: === Iteration 7 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:01:43,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:01:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1958551269, now seen corresponding path program 1 times [2019-10-02 02:01:43,651 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:01:43,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:01:43,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:43,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:43,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:43,780 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-02 02:01:43,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 02:01:43,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 02:01:43,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 02:01:43,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 02:01:43,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 02:01:43,783 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand 7 states. [2019-10-02 02:01:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:01:43,902 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-10-02 02:01:43,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 02:01:43,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-10-02 02:01:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:01:43,904 INFO L225 Difference]: With dead ends: 131 [2019-10-02 02:01:43,904 INFO L226 Difference]: Without dead ends: 79 [2019-10-02 02:01:43,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 02:01:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-02 02:01:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2019-10-02 02:01:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-02 02:01:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2019-10-02 02:01:43,915 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 32 [2019-10-02 02:01:43,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:01:43,915 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2019-10-02 02:01:43,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 02:01:43,915 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2019-10-02 02:01:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 02:01:43,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:01:43,917 INFO L411 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] [2019-10-02 02:01:43,917 INFO L418 AbstractCegarLoop]: === Iteration 8 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:01:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:01:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2117561309, now seen corresponding path program 1 times [2019-10-02 02:01:43,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:01:43,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:01:43,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:43,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:43,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:01:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:44,214 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-02 02:01:44,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:01:44,216 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:01:44,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:01:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:01:44,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-02 02:01:44,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:01:44,504 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 21 treesize of output 9 [2019-10-02 02:01:44,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:44,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:44,522 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-02 02:01:44,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:12 [2019-10-02 02:01:44,570 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|, |v_#memory_int_52|], 2=[|v_#memory_int_54|], 3=[|v_#memory_int_53|], 7=[|v_#memory_$Pointer$.base_61|, |v_#memory_$Pointer$.offset_61|]} [2019-10-02 02:01:44,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-10-02 02:01:44,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:44,751 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-02 02:01:44,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:44,758 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:01:44,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:44,827 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:01:44,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:45,067 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-10-02 02:01:45,067 INFO L341 Elim1Store]: treesize reduction 164, result has 35.7 percent of original size [2019-10-02 02:01:45,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 80 treesize of output 97 [2019-10-02 02:01:45,069 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:01:45,217 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-02 02:01:45,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:45,316 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:01:45,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 163 [2019-10-02 02:01:45,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:01:45,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 02:01:45,456 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_19, v_prenex_21, v_prenex_20, v_prenex_1, v_prenex_2, v_prenex_22, v_prenex_3, v_prenex_4], 2=[v_prenex_10, v_arrayElimArr_2, v_prenex_14, v_prenex_13, v_prenex_23, v_prenex_11, v_prenex_5, v_prenex_27], 4=[v_prenex_8, v_prenex_9, v_prenex_25, v_prenex_24, v_prenex_12, v_prenex_18, v_prenex_28, v_prenex_17, v_prenex_16, v_prenex_26, v_prenex_15, v_arrayElimArr_1, v_prenex_6, v_prenex_7]} [2019-10-02 02:01:45,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:01:45,663 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no XNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:465) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-02 02:01:45,668 INFO L168 Benchmark]: Toolchain (without parser) took 77745.39 ms. Allocated memory was 139.5 MB in the beginning and 315.6 MB in the end (delta: 176.2 MB). Free memory was 84.4 MB in the beginning and 121.2 MB in the end (delta: -36.8 MB). Peak memory consumption was 139.3 MB. Max. memory is 7.1 GB. [2019-10-02 02:01:45,669 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 139.5 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 02:01:45,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.52 ms. Allocated memory was 139.5 MB in the beginning and 199.8 MB in the end (delta: 60.3 MB). Free memory was 84.2 MB in the beginning and 162.5 MB in the end (delta: -78.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-10-02 02:01:45,671 INFO L168 Benchmark]: Boogie Preprocessor took 84.27 ms. Allocated memory is still 199.8 MB. Free memory was 162.5 MB in the beginning and 158.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-10-02 02:01:45,671 INFO L168 Benchmark]: RCFGBuilder took 762.53 ms. Allocated memory is still 199.8 MB. Free memory was 158.9 MB in the beginning and 100.1 MB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 7.1 GB. [2019-10-02 02:01:45,672 INFO L168 Benchmark]: TraceAbstraction took 76230.89 ms. Allocated memory was 199.8 MB in the beginning and 315.6 MB in the end (delta: 115.9 MB). Free memory was 99.5 MB in the beginning and 121.2 MB in the end (delta: -21.7 MB). Peak memory consumption was 94.2 MB. Max. memory is 7.1 GB. [2019-10-02 02:01:45,676 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42 ms. Allocated memory is still 139.5 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 663.52 ms. Allocated memory was 139.5 MB in the beginning and 199.8 MB in the end (delta: 60.3 MB). Free memory was 84.2 MB in the beginning and 162.5 MB in the end (delta: -78.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.27 ms. Allocated memory is still 199.8 MB. Free memory was 162.5 MB in the beginning and 158.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 762.53 ms. Allocated memory is still 199.8 MB. Free memory was 158.9 MB in the beginning and 100.1 MB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76230.89 ms. Allocated memory was 199.8 MB in the beginning and 315.6 MB in the end (delta: 115.9 MB). Free memory was 99.5 MB in the beginning and 121.2 MB in the end (delta: -21.7 MB). Peak memory consumption was 94.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no XNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no XNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...