java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:27:13,907 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:27:13,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:27:13,919 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:27:13,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:27:13,920 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:27:13,921 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:27:13,922 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:27:13,924 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:27:13,925 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:27:13,926 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:27:13,926 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:27:13,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:27:13,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:27:13,928 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:27:13,930 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:27:13,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:27:13,933 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:27:13,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:27:13,934 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:27:13,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:27:13,936 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:27:13,936 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:27:13,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:27:13,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:27:13,939 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:27:13,939 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:27:13,940 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:27:13,940 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:27:13,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:27:13,941 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:27:13,941 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 15:27:13,962 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:27:13,962 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:27:13,963 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:27:13,963 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:27:13,963 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:27:13,963 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:27:13,963 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:27:13,963 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:27:13,963 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:27:13,963 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:27:13,963 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:27:13,964 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:27:13,964 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:27:13,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:27:13,964 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:27:13,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:27:13,964 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:27:13,964 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:27:13,964 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:27:13,964 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:27:13,964 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:27:13,965 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:27:13,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:27:13,965 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:27:13,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:27:14,003 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:27:14,006 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:27:14,007 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:27:14,008 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:27:14,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,416 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2689dcfaa [2018-04-11 15:27:14,545 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:27:14,546 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:27:14,546 INFO L168 CDTParser]: Scanning substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,555 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:27:14,555 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:27:14,555 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:27:14,555 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ ('') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,555 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__register_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____socklen_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____intptr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__size_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsword_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uint in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__div_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__wchar_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__lldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ulong in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____useconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_set in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ushort in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____qaddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:14,578 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2689dcfaa [2018-04-11 15:27:14,581 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:27:14,582 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:27:14,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:27:14,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:27:14,586 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:27:14,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:27:14" (1/1) ... [2018-04-11 15:27:14,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bfc56e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:14, skipping insertion in model container [2018-04-11 15:27:14,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:27:14" (1/1) ... [2018-04-11 15:27:14,603 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:27:14,625 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:27:14,776 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:27:14,810 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:27:14,815 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 15:27:14,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:14 WrapperNode [2018-04-11 15:27:14,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:27:14,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:27:14,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:27:14,859 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:27:14,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:14" (1/1) ... [2018-04-11 15:27:14,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:14" (1/1) ... [2018-04-11 15:27:14,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:14" (1/1) ... [2018-04-11 15:27:14,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:14" (1/1) ... [2018-04-11 15:27:14,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:14" (1/1) ... [2018-04-11 15:27:14,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:14" (1/1) ... [2018-04-11 15:27:14,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:14" (1/1) ... [2018-04-11 15:27:14,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:27:14,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:27:14,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:27:14,896 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:27:14,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:14" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-04-11 15:27:14,978 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:27:14,978 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:27:14,978 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:27:14,978 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:27:14,978 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-04-11 15:27:14,978 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:27:14,978 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:27:14,979 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:27:14,980 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:27:14,981 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:27:14,982 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:27:14,983 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:27:14,984 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:27:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:27:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:27:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:27:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:27:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:27:14,985 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:27:15,260 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:27:15,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:27:15 BoogieIcfgContainer [2018-04-11 15:27:15,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:27:15,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:27:15,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:27:15,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:27:15,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:27:14" (1/3) ... [2018-04-11 15:27:15,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf5df0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:27:15, skipping insertion in model container [2018-04-11 15:27:15,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:14" (2/3) ... [2018-04-11 15:27:15,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf5df0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:27:15, skipping insertion in model container [2018-04-11 15:27:15,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:27:15" (3/3) ... [2018-04-11 15:27:15,265 INFO L107 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:27:15,271 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:27:15,277 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-11 15:27:15,298 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:27:15,299 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:27:15,299 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:27:15,299 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:27:15,299 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:27:15,299 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:27:15,299 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:27:15,299 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:27:15,299 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:27:15,300 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:27:15,307 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-04-11 15:27:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:27:15,313 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:15,313 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:15,314 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1359245197, now seen corresponding path program 1 times [2018-04-11 15:27:15,317 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:15,317 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:15,346 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:15,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:15,346 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:15,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:15,400 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:27:15,400 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:15,400 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:15,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:15,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:15,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:15,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:15,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:15,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:27:15,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:15,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:15,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:27:15,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:15,494 INFO L267 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. [2018-04-11 15:27:15,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 15:27:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:15,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:15,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:27:15,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:27:15,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:27:15,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:27:15,532 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 5 states. [2018-04-11 15:27:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:15,622 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-04-11 15:27:15,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:27:15,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-11 15:27:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:15,628 INFO L225 Difference]: With dead ends: 55 [2018-04-11 15:27:15,628 INFO L226 Difference]: Without dead ends: 52 [2018-04-11 15:27:15,629 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:27:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-11 15:27:15,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-11 15:27:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 15:27:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-11 15:27:15,652 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-04-11 15:27:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:15,652 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-11 15:27:15,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:27:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-11 15:27:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:27:15,653 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:15,653 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:15,653 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:15,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1359245198, now seen corresponding path program 1 times [2018-04-11 15:27:15,654 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:15,654 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:15,655 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:15,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:15,655 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:15,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:15,673 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:27:15,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:15,673 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:15,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:15,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:15,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:15,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:15,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:15,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:15,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:15,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:27:15,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:15,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:27:15,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:15,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:15,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:15,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:27:15,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:15,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:15,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:27:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:15,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:15,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:27:15,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:27:15,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:27:15,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:27:15,767 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-04-11 15:27:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:15,897 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-04-11 15:27:15,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:27:15,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 15:27:15,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:15,900 INFO L225 Difference]: With dead ends: 69 [2018-04-11 15:27:15,900 INFO L226 Difference]: Without dead ends: 69 [2018-04-11 15:27:15,901 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:27:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-04-11 15:27:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-04-11 15:27:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-11 15:27:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-04-11 15:27:15,910 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 13 [2018-04-11 15:27:15,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:15,910 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-04-11 15:27:15,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:27:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-04-11 15:27:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:27:15,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:15,910 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:15,911 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:15,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1160714736, now seen corresponding path program 1 times [2018-04-11 15:27:15,911 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:15,911 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:15,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:15,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:15,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:15,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:15,924 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:27:15,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:15,925 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:15,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:15,944 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:15,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:15,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:15,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:15,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:15,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:15,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:27:15,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:15,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:15,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:27:15,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:16,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:27:16,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:16,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:16,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:27:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:16,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:16,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:27:16,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:27:16,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:27:16,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:27:16,019 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 6 states. [2018-04-11 15:27:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:16,075 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-04-11 15:27:16,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:27:16,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 15:27:16,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:16,076 INFO L225 Difference]: With dead ends: 57 [2018-04-11 15:27:16,076 INFO L226 Difference]: Without dead ends: 57 [2018-04-11 15:27:16,077 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:27:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-11 15:27:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-04-11 15:27:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:27:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-11 15:27:16,080 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-04-11 15:27:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:16,080 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-11 15:27:16,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:27:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-11 15:27:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:27:16,080 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:16,080 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:16,080 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash -813071859, now seen corresponding path program 1 times [2018-04-11 15:27:16,081 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:16,081 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:16,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:16,082 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:16,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:16,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:16,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:27:16,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:27:16,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:27:16,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:27:16,107 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-04-11 15:27:16,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:16,139 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-04-11 15:27:16,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:27:16,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 15:27:16,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:16,148 INFO L225 Difference]: With dead ends: 50 [2018-04-11 15:27:16,148 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 15:27:16,149 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:27:16,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 15:27:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-11 15:27:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:27:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-11 15:27:16,151 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-04-11 15:27:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:16,152 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-11 15:27:16,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:27:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-11 15:27:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:27:16,152 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:16,152 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:16,153 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:16,153 INFO L82 PathProgramCache]: Analyzing trace with hash -813071858, now seen corresponding path program 1 times [2018-04-11 15:27:16,153 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:16,153 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:16,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:16,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:16,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:16,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:16,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:27:16,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:27:16,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:27:16,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:27:16,200 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-04-11 15:27:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:16,222 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-11 15:27:16,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:27:16,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 15:27:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:16,223 INFO L225 Difference]: With dead ends: 49 [2018-04-11 15:27:16,223 INFO L226 Difference]: Without dead ends: 49 [2018-04-11 15:27:16,223 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:27:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-11 15:27:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-11 15:27:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-11 15:27:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-11 15:27:16,227 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-04-11 15:27:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:16,228 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-11 15:27:16,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:27:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-11 15:27:16,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:27:16,228 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:16,228 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:16,228 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:16,229 INFO L82 PathProgramCache]: Analyzing trace with hash 198035442, now seen corresponding path program 1 times [2018-04-11 15:27:16,229 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:16,229 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:16,230 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:16,230 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:16,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:16,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:16,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:27:16,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:27:16,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:27:16,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:27:16,274 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-04-11 15:27:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:16,318 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-11 15:27:16,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:27:16,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 15:27:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:16,319 INFO L225 Difference]: With dead ends: 48 [2018-04-11 15:27:16,319 INFO L226 Difference]: Without dead ends: 48 [2018-04-11 15:27:16,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:27:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-11 15:27:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-11 15:27:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-11 15:27:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-04-11 15:27:16,321 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-04-11 15:27:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:16,321 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-04-11 15:27:16,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:27:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-04-11 15:27:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:27:16,321 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:16,321 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:16,322 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:16,322 INFO L82 PathProgramCache]: Analyzing trace with hash 198035443, now seen corresponding path program 1 times [2018-04-11 15:27:16,322 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:16,322 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:16,322 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:16,322 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:16,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:16,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:16,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:27:16,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:27:16,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:27:16,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:27:16,389 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-04-11 15:27:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:16,467 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-04-11 15:27:16,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:27:16,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-11 15:27:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:16,469 INFO L225 Difference]: With dead ends: 72 [2018-04-11 15:27:16,469 INFO L226 Difference]: Without dead ends: 72 [2018-04-11 15:27:16,469 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:27:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-11 15:27:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-04-11 15:27:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:27:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-11 15:27:16,471 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-04-11 15:27:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:16,471 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-11 15:27:16,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:27:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-11 15:27:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 15:27:16,472 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:16,472 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:16,472 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:16,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1611194078, now seen corresponding path program 1 times [2018-04-11 15:27:16,472 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:16,472 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:16,472 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:16,473 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:16,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:16,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:16,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:27:16,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:27:16,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:27:16,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:27:16,507 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-04-11 15:27:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:16,558 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-04-11 15:27:16,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:27:16,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-11 15:27:16,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:16,559 INFO L225 Difference]: With dead ends: 51 [2018-04-11 15:27:16,560 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 15:27:16,560 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:27:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 15:27:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-04-11 15:27:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 15:27:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-11 15:27:16,563 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-04-11 15:27:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:16,563 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-11 15:27:16,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:27:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-11 15:27:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 15:27:16,564 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:16,564 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:16,564 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:16,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1611194077, now seen corresponding path program 1 times [2018-04-11 15:27:16,564 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:16,564 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:16,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:16,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:16,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:16,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:16,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:27:16,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:27:16,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:27:16,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:27:16,652 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-04-11 15:27:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:16,750 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-04-11 15:27:16,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:27:16,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-11 15:27:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:16,750 INFO L225 Difference]: With dead ends: 66 [2018-04-11 15:27:16,751 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 15:27:16,751 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:27:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 15:27:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-04-11 15:27:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 15:27:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-04-11 15:27:16,753 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-04-11 15:27:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:16,755 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-04-11 15:27:16,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:27:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-04-11 15:27:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:27:16,755 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:16,756 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:16,756 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:16,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1620411736, now seen corresponding path program 1 times [2018-04-11 15:27:16,756 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:16,756 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:16,756 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:16,757 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:16,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:16,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:16,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:16,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:27:16,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:27:16,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:27:16,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:27:16,796 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-04-11 15:27:16,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:16,848 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-04-11 15:27:16,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:27:16,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-11 15:27:16,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:16,849 INFO L225 Difference]: With dead ends: 59 [2018-04-11 15:27:16,849 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 15:27:16,849 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:27:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 15:27:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-04-11 15:27:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:27:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-04-11 15:27:16,851 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-04-11 15:27:16,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:16,851 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-04-11 15:27:16,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:27:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-04-11 15:27:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:27:16,851 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:16,851 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:16,852 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:16,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1620411735, now seen corresponding path program 1 times [2018-04-11 15:27:16,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:16,852 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:16,852 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:16,852 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:16,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:16,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:16,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:27:16,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:27:16,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:27:16,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:27:16,928 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-04-11 15:27:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:17,026 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2018-04-11 15:27:17,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:27:17,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-11 15:27:17,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:17,026 INFO L225 Difference]: With dead ends: 92 [2018-04-11 15:27:17,026 INFO L226 Difference]: Without dead ends: 92 [2018-04-11 15:27:17,027 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:27:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-11 15:27:17,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-04-11 15:27:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-11 15:27:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-04-11 15:27:17,030 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-04-11 15:27:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:17,031 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-04-11 15:27:17,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:27:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-04-11 15:27:17,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:27:17,031 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:17,032 INFO L355 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] [2018-04-11 15:27:17,032 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:17,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1307124962, now seen corresponding path program 1 times [2018-04-11 15:27:17,032 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:17,032 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:17,033 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:17,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:17,033 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:17,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:17,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:17,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:27:17,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:27:17,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:27:17,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:27:17,053 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-04-11 15:27:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:17,058 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-04-11 15:27:17,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:27:17,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-04-11 15:27:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:17,059 INFO L225 Difference]: With dead ends: 64 [2018-04-11 15:27:17,059 INFO L226 Difference]: Without dead ends: 64 [2018-04-11 15:27:17,060 INFO L567 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 [2018-04-11 15:27:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-11 15:27:17,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-04-11 15:27:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-11 15:27:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-04-11 15:27:17,062 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-04-11 15:27:17,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:17,063 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-04-11 15:27:17,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:27:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-04-11 15:27:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:27:17,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:17,063 INFO L355 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] [2018-04-11 15:27:17,064 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:17,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2015624486, now seen corresponding path program 1 times [2018-04-11 15:27:17,064 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:17,064 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:17,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:17,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:17,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:17,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:17,122 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:17,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:27:17,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:27:17,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:27:17,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:27:17,123 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-04-11 15:27:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:17,166 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-04-11 15:27:17,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:27:17,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-11 15:27:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:17,167 INFO L225 Difference]: With dead ends: 70 [2018-04-11 15:27:17,167 INFO L226 Difference]: Without dead ends: 70 [2018-04-11 15:27:17,167 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:27:17,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-11 15:27:17,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-04-11 15:27:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 15:27:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-04-11 15:27:17,170 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-04-11 15:27:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:17,170 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-04-11 15:27:17,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:27:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-04-11 15:27:17,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:27:17,171 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:17,171 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:17,171 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:17,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1801524697, now seen corresponding path program 1 times [2018-04-11 15:27:17,171 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:17,171 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:17,172 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:17,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:17,172 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:17,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:17,182 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:27:17,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:17,182 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:17,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:17,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:17,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:17,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 15:27:17,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:17,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:27:17,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:17,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:17,234 INFO L267 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. [2018-04-11 15:27:17,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:27:17,273 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-11 15:27:17,279 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-11 15:27:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:17,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:17,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:27:17,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:27:17,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:27:17,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-11 15:27:17,285 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 8 states. [2018-04-11 15:27:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:17,373 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-04-11 15:27:17,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:27:17,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-11 15:27:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:17,374 INFO L225 Difference]: With dead ends: 66 [2018-04-11 15:27:17,374 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 15:27:17,374 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-11 15:27:17,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 15:27:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 15:27:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 15:27:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-04-11 15:27:17,376 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-04-11 15:27:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:17,377 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-04-11 15:27:17,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:27:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-04-11 15:27:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:27:17,377 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:17,377 INFO L355 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] [2018-04-11 15:27:17,377 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1695652845, now seen corresponding path program 1 times [2018-04-11 15:27:17,378 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:17,378 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:17,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:17,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:17,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:17,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:17,393 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:27:17,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:17,393 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:17,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:17,421 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:17,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:17,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:17,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:17,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:27:17,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:17,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:17,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:27:17,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:17,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:17,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 15:27:17,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:27:17,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:27:17,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:17,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:17,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:27:17,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 15:27:17,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 15:27:17,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:27:17,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:17,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:17,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 15:27:17,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:36 [2018-04-11 15:27:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 15:27:17,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:17,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 15:27:17,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:27:17,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:27:17,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:27:17,636 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 12 states. [2018-04-11 15:27:17,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:17,856 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-04-11 15:27:17,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:27:17,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-04-11 15:27:17,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:17,857 INFO L225 Difference]: With dead ends: 66 [2018-04-11 15:27:17,857 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 15:27:17,857 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:27:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 15:27:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 15:27:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 15:27:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-11 15:27:17,859 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 29 [2018-04-11 15:27:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:17,859 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-11 15:27:17,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:27:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-11 15:27:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:27:17,860 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:17,860 INFO L355 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] [2018-04-11 15:27:17,860 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:17,860 INFO L82 PathProgramCache]: Analyzing trace with hash 793876117, now seen corresponding path program 1 times [2018-04-11 15:27:17,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:17,860 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:17,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:17,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:17,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:17,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:17,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:17,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:27:17,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:27:17,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:27:17,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:27:17,961 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 11 states. [2018-04-11 15:27:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:18,082 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-04-11 15:27:18,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:27:18,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-04-11 15:27:18,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:18,084 INFO L225 Difference]: With dead ends: 69 [2018-04-11 15:27:18,084 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 15:27:18,084 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:27:18,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 15:27:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 15:27:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 15:27:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-04-11 15:27:18,086 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 29 [2018-04-11 15:27:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:18,086 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-04-11 15:27:18,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:27:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-04-11 15:27:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:27:18,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:18,087 INFO L355 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] [2018-04-11 15:27:18,087 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:18,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1012730835, now seen corresponding path program 1 times [2018-04-11 15:27:18,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:18,088 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:18,088 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:18,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:18,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:18,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:18,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:18,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:18,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:18,307 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:18,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:18,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:18,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:18,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:27:18,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:27:18,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:27:18,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:18,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:18,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:18,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:27:18,444 INFO L477 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 20 treesize of output 16 [2018-04-11 15:27:18,449 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:27:18,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:27:18,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:18,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:18,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-04-11 15:27:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:18,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:18,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-04-11 15:27:18,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:27:18,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:27:18,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:27:18,597 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 22 states. [2018-04-11 15:27:19,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:19,098 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-04-11 15:27:19,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:27:19,098 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-04-11 15:27:19,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:19,099 INFO L225 Difference]: With dead ends: 77 [2018-04-11 15:27:19,099 INFO L226 Difference]: Without dead ends: 75 [2018-04-11 15:27:19,099 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:27:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-11 15:27:19,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-04-11 15:27:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-11 15:27:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-04-11 15:27:19,101 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 29 [2018-04-11 15:27:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:19,101 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-04-11 15:27:19,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:27:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-04-11 15:27:19,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:27:19,102 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:19,102 INFO L355 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] [2018-04-11 15:27:19,102 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:19,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1724257321, now seen corresponding path program 1 times [2018-04-11 15:27:19,102 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:19,102 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:19,102 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:19,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:19,102 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:19,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:19,115 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:27:19,115 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:19,116 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:19,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:19,141 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:19,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:19,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:19,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:19,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:19,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:19,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:27:19,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:19,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:27:19,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:19,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:19,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:19,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:27:19,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:19,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:19,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:27:19,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:27:19,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:27:19,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:19,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:19,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:19,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-11 15:27:19,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 15:27:19,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:27:19,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:19,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:19,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:27:19,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-04-11 15:27:19,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-04-11 15:27:19,329 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:27:19,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:27:19,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-11 15:27:19,336 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:19,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:19,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:19,348 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:54 [2018-04-11 15:27:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:19,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:27:19,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 15:27:19,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:27:19,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:27:19,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:27:19,427 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 13 states. [2018-04-11 15:27:20,779 WARN L151 SmtUtils]: Spent 1225ms on a formula simplification. DAG size of input: 47 DAG size of output 43 [2018-04-11 15:27:21,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:21,244 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2018-04-11 15:27:21,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:27:21,245 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-04-11 15:27:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:21,245 INFO L225 Difference]: With dead ends: 125 [2018-04-11 15:27:21,245 INFO L226 Difference]: Without dead ends: 125 [2018-04-11 15:27:21,245 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:27:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-11 15:27:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2018-04-11 15:27:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 15:27:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-04-11 15:27:21,248 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 31 [2018-04-11 15:27:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:21,248 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-04-11 15:27:21,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:27:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2018-04-11 15:27:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:27:21,249 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:21,249 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:21,249 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:21,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1820036441, now seen corresponding path program 1 times [2018-04-11 15:27:21,249 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:21,249 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:21,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:21,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:21,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:21,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:21,264 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:27:21,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:21,265 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:21,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:21,293 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:21,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:21,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:21,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:21,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-11 15:27:21,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:27:21,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:27:21,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:21,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:21,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:27:21,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-11 15:27:21,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2018-04-11 15:27:21,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 15:27:21,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:21,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:21,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:27:21,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2018-04-11 15:27:21,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2018-04-11 15:27:21,725 INFO L477 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 51 [2018-04-11 15:27:21,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 15:27:21,765 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2018-04-11 15:27:21,765 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:27:21,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-11 15:27:21,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:21,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-04-11 15:27:21,808 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:21,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-11 15:27:21,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 15:27:21,877 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:72, output treesize:387 [2018-04-11 15:27:22,054 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-04-11 15:27:22,229 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 44 DAG size of output 34 [2018-04-11 15:27:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:22,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:27:22,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:27:22,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:27:22,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:27:22,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:27:22,321 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 20 states. [2018-04-11 15:27:22,737 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 81 DAG size of output 81 [2018-04-11 15:27:23,121 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 112 DAG size of output 103 [2018-04-11 15:27:23,469 WARN L151 SmtUtils]: Spent 319ms on a formula simplification. DAG size of input: 116 DAG size of output 111 [2018-04-11 15:27:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:23,777 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-04-11 15:27:23,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:27:23,777 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-04-11 15:27:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:23,778 INFO L225 Difference]: With dead ends: 100 [2018-04-11 15:27:23,778 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 15:27:23,778 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=215, Invalid=1117, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:27:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 15:27:23,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2018-04-11 15:27:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 15:27:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2018-04-11 15:27:23,781 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 33 [2018-04-11 15:27:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:23,781 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2018-04-11 15:27:23,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:27:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2018-04-11 15:27:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 15:27:23,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:23,781 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:23,781 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:23,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2127994563, now seen corresponding path program 2 times [2018-04-11 15:27:23,782 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:23,782 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:23,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:23,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:23,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:23,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:24,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:24,010 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:24,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:27:24,035 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:27:24,035 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:24,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:24,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:24,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:24,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:24,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:27:24,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:27:24,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:27:24,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:24,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:24,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:24,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 15:27:24,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-04-11 15:27:24,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-04-11 15:27:24,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:24,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-11 15:27:24,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:24,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-04-11 15:27:24,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-11 15:27:24,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:27:24,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:27:24,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:85 [2018-04-11 15:27:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:24,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:24,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 28 [2018-04-11 15:27:24,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:27:24,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:27:24,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:27:24,450 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 29 states. [2018-04-11 15:27:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:25,128 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2018-04-11 15:27:25,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:27:25,128 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2018-04-11 15:27:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:25,129 INFO L225 Difference]: With dead ends: 134 [2018-04-11 15:27:25,129 INFO L226 Difference]: Without dead ends: 132 [2018-04-11 15:27:25,130 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:27:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-11 15:27:25,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2018-04-11 15:27:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 15:27:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2018-04-11 15:27:25,132 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 37 [2018-04-11 15:27:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:25,132 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2018-04-11 15:27:25,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:27:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2018-04-11 15:27:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:27:25,133 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:25,133 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:25,133 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:25,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1372787131, now seen corresponding path program 1 times [2018-04-11 15:27:25,133 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:25,133 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:25,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:25,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:25,134 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:25,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:25,196 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:25,196 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:25,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:25,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:25,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:25,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-04-11 15:27:25,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:27:25,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:27:25,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:27:25,295 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand 16 states. [2018-04-11 15:27:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:25,453 INFO L93 Difference]: Finished difference Result 161 states and 181 transitions. [2018-04-11 15:27:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:27:25,453 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-04-11 15:27:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:25,454 INFO L225 Difference]: With dead ends: 161 [2018-04-11 15:27:25,454 INFO L226 Difference]: Without dead ends: 161 [2018-04-11 15:27:25,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:27:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-11 15:27:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 101. [2018-04-11 15:27:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 15:27:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2018-04-11 15:27:25,457 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 38 [2018-04-11 15:27:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:25,458 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2018-04-11 15:27:25,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:27:25,458 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2018-04-11 15:27:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 15:27:25,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:25,458 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:25,459 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash -518903735, now seen corresponding path program 2 times [2018-04-11 15:27:25,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:25,459 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:25,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:25,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:25,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:25,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:25,474 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:27:25,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:25,474 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:25,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:27:25,495 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:27:25,495 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:25,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:25,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:25,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:25,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:25,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:25,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:25,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:27:25,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:25,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:27:25,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:25,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:25,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:25,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:27:25,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:25,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:25,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:27:25,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:27:25,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:27:25,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:25,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:25,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:25,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-11 15:27:25,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 15:27:25,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:27:25,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:25,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:25,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:27:25,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-11 15:27:27,910 WARN L148 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-11 15:27:27,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-04-11 15:27:27,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:27,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 29 [2018-04-11 15:27:27,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:27:28,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-04-11 15:27:28,005 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:28,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:28,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:28,026 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:69, output treesize:54 [2018-04-11 15:27:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:28,102 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:27:28,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:27:28,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:27:28,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:27:28,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:27:28,103 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand 20 states. [2018-04-11 15:27:31,761 WARN L151 SmtUtils]: Spent 3184ms on a formula simplification. DAG size of input: 75 DAG size of output 75 [2018-04-11 15:27:32,272 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 91 DAG size of output 85 [2018-04-11 15:27:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:33,093 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2018-04-11 15:27:33,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:27:33,094 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-04-11 15:27:33,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:33,094 INFO L225 Difference]: With dead ends: 115 [2018-04-11 15:27:33,094 INFO L226 Difference]: Without dead ends: 115 [2018-04-11 15:27:33,095 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:27:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-11 15:27:33,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-04-11 15:27:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 15:27:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-04-11 15:27:33,097 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 41 [2018-04-11 15:27:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:33,097 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-04-11 15:27:33,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:27:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-04-11 15:27:33,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:27:33,098 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:33,098 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:33,098 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:33,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1224572237, now seen corresponding path program 2 times [2018-04-11 15:27:33,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:33,098 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:33,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:33,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:33,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:33,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:33,110 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:27:33,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:33,110 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:33,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:27:33,125 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:27:33,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:33,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:33,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:33,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:33,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:33,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:33,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:33,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:27:33,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:33,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:27:33,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:33,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:33,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:33,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:27:33,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:33,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:33,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:27:33,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:27:33,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:27:33,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:33,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:33,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:33,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 15:27:33,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 15:27:33,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:27:33,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:33,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:33,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:27:33,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-11 15:27:33,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-04-11 15:27:33,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-11 15:27:33,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:33,322 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:27:33,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:27:33,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:33,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:33,336 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:48 [2018-04-11 15:27:33,394 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:33,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:27:33,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:27:33,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:27:33,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:27:33,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:27:33,395 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 15 states. [2018-04-11 15:27:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:34,964 INFO L93 Difference]: Finished difference Result 193 states and 219 transitions. [2018-04-11 15:27:34,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:27:34,964 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-04-11 15:27:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:34,965 INFO L225 Difference]: With dead ends: 193 [2018-04-11 15:27:34,965 INFO L226 Difference]: Without dead ends: 193 [2018-04-11 15:27:34,965 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:27:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-11 15:27:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 139. [2018-04-11 15:27:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-11 15:27:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 166 transitions. [2018-04-11 15:27:34,967 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 166 transitions. Word has length 44 [2018-04-11 15:27:34,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:34,968 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 166 transitions. [2018-04-11 15:27:34,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:27:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 166 transitions. [2018-04-11 15:27:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 15:27:34,968 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:34,968 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:34,968 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:34,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1069957555, now seen corresponding path program 3 times [2018-04-11 15:27:34,968 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:34,968 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:34,969 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:34,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:34,969 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:34,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-11 15:27:35,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:35,134 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:35,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:27:35,168 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:27:35,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:35,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:35,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:35,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:27:35,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:27:35,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:27:35,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-11 15:27:35,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:27:35,255 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:27:35,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:27:35,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:35,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:35,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-11 15:27:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 15:27:35,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:35,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-04-11 15:27:35,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:27:35,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:27:35,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:27:35,345 INFO L87 Difference]: Start difference. First operand 139 states and 166 transitions. Second operand 16 states. [2018-04-11 15:27:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:35,685 INFO L93 Difference]: Finished difference Result 151 states and 171 transitions. [2018-04-11 15:27:35,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:27:35,685 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-04-11 15:27:35,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:35,686 INFO L225 Difference]: With dead ends: 151 [2018-04-11 15:27:35,686 INFO L226 Difference]: Without dead ends: 149 [2018-04-11 15:27:35,686 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:27:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-11 15:27:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2018-04-11 15:27:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-11 15:27:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-04-11 15:27:35,687 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 45 [2018-04-11 15:27:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:35,688 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-04-11 15:27:35,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:27:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-04-11 15:27:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 15:27:35,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:35,688 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:35,688 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:35,688 INFO L82 PathProgramCache]: Analyzing trace with hash 981065013, now seen corresponding path program 1 times [2018-04-11 15:27:35,688 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:35,688 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:35,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:35,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:35,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:35,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:35,709 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:27:35,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:35,709 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:35,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:35,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:35,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:35,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:35,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:27:35,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:35,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:35,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:27:35,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:27:35,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:27:35,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:27:35,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:27:35,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 15:27:35,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 15:27:35,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:27:35,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:35,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:27:35,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-11 15:27:36,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-04-11 15:27:36,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-11 15:27:36,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:36,057 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:27:36,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:27:36,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:36,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:36,076 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:66, output treesize:64 [2018-04-11 15:27:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:36,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:27:36,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:27:36,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:27:36,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:27:36,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:27:36,208 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 18 states. [2018-04-11 15:27:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:37,129 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-04-11 15:27:37,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:27:37,129 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-04-11 15:27:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:37,130 INFO L225 Difference]: With dead ends: 115 [2018-04-11 15:27:37,130 INFO L226 Difference]: Without dead ends: 115 [2018-04-11 15:27:37,130 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:27:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-11 15:27:37,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-04-11 15:27:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 15:27:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-04-11 15:27:37,131 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 46 [2018-04-11 15:27:37,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:37,131 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-04-11 15:27:37,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:27:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-04-11 15:27:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:27:37,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:37,132 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:37,132 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:37,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1969827015, now seen corresponding path program 3 times [2018-04-11 15:27:37,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:37,132 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:37,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:37,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:37,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:37,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:37,155 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:27:37,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:37,155 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:37,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:27:37,177 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:27:37,178 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:37,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:37,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:37,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:37,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:37,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:37,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:37,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:27:37,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:37,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:27:37,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:37,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:37,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:37,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:27:37,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:37,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:37,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:27:37,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:27:37,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:27:37,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:37,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:37,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:37,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 15:27:37,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 15:27:37,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:27:37,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:37,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:37,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:27:37,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 15:27:39,419 WARN L148 SmtUtils]: Spent 2014ms on a formula simplification that was a NOOP. DAG size: 32 [2018-04-11 15:27:40,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-04-11 15:27:40,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-04-11 15:27:40,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:40,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 47 [2018-04-11 15:27:40,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-11 15:27:40,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2018-04-11 15:27:40,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:40,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-04-11 15:27:40,341 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:40,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-04-11 15:27:40,343 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:40,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-11 15:27:40,381 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:40,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-04-11 15:27:40,420 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:40,458 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2018-04-11 15:27:40,459 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 15:27:40,500 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2018-04-11 15:27:40,500 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-11 15:27:40,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-11 15:27:40,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:27:40,598 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:60, output treesize:86 [2018-04-11 15:27:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 36 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 15:27:40,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:27:40,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:27:40,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:27:40,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:27:40,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=302, Unknown=1, NotChecked=0, Total=342 [2018-04-11 15:27:40,681 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 19 states. [2018-04-11 15:27:41,211 WARN L151 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 72 DAG size of output 62 [2018-04-11 15:27:41,424 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 76 DAG size of output 63 [2018-04-11 15:27:43,806 WARN L148 SmtUtils]: Spent 2035ms on a formula simplification that was a NOOP. DAG size: 65 [2018-04-11 15:27:44,332 WARN L151 SmtUtils]: Spent 347ms on a formula simplification. DAG size of input: 78 DAG size of output 68 [2018-04-11 15:27:44,596 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 82 DAG size of output 69 [2018-04-11 15:27:44,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:44,999 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-04-11 15:27:45,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:27:45,000 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-04-11 15:27:45,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:45,000 INFO L225 Difference]: With dead ends: 117 [2018-04-11 15:27:45,000 INFO L226 Difference]: Without dead ends: 117 [2018-04-11 15:27:45,001 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=319, Invalid=1320, Unknown=1, NotChecked=0, Total=1640 [2018-04-11 15:27:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-11 15:27:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 58. [2018-04-11 15:27:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-11 15:27:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-04-11 15:27:45,002 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 49 [2018-04-11 15:27:45,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:45,002 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-04-11 15:27:45,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:27:45,002 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-04-11 15:27:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 15:27:45,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:45,003 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:45,003 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 15:27:45,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1291252055, now seen corresponding path program 3 times [2018-04-11 15:27:45,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:45,003 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:45,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:45,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:45,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:45,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:45,028 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:27:45,028 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:45,028 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:45,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:27:45,060 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:27:45,060 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:45,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:45,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:45,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:45,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:27:45,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:45,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:45,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:27:45,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:45,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:27:45,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:45,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:45,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:27:45,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:27:45,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:45,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:45,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:27:45,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:27:45,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:27:45,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:45,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:45,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:45,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 15:27:45,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 15:27:45,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:27:45,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:45,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:27:45,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:27:45,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-11 15:27:45,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-04-11 15:27:45,222 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:27:45,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:27:45,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-11 15:27:45,229 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:27:45,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:45,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:27:45,238 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-11 15:27:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-04-11 15:27:45,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:27:45,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 15:27:45,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:27:45,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:27:45,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:27:45,313 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 13 states. [2018-04-11 15:27:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:45,666 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-04-11 15:27:45,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:27:45,667 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-04-11 15:27:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:45,667 INFO L225 Difference]: With dead ends: 57 [2018-04-11 15:27:45,667 INFO L226 Difference]: Without dead ends: 0 [2018-04-11 15:27:45,667 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:27:45,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-11 15:27:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-11 15:27:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-11 15:27:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-11 15:27:45,668 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-04-11 15:27:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:45,668 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-11 15:27:45,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:27:45,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-11 15:27:45,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-11 15:27:45,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:27:45 BoogieIcfgContainer [2018-04-11 15:27:45,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:27:45,671 INFO L168 Benchmark]: Toolchain (without parser) took 31090.35 ms. Allocated memory was 394.8 MB in the beginning and 930.1 MB in the end (delta: 535.3 MB). Free memory was 327.5 MB in the beginning and 578.7 MB in the end (delta: -251.2 MB). Peak memory consumption was 284.1 MB. Max. memory is 5.3 GB. [2018-04-11 15:27:45,672 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 394.8 MB. Free memory is still 353.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:27:45,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.50 ms. Allocated memory is still 394.8 MB. Free memory was 327.0 MB in the beginning and 303.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 15:27:45,673 INFO L168 Benchmark]: Boogie Preprocessor took 36.83 ms. Allocated memory is still 394.8 MB. Free memory was 303.2 MB in the beginning and 300.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-04-11 15:27:45,673 INFO L168 Benchmark]: RCFGBuilder took 364.37 ms. Allocated memory was 394.8 MB in the beginning and 593.5 MB in the end (delta: 198.7 MB). Free memory was 300.5 MB in the beginning and 526.7 MB in the end (delta: -226.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. [2018-04-11 15:27:45,675 INFO L168 Benchmark]: TraceAbstraction took 30410.16 ms. Allocated memory was 593.5 MB in the beginning and 930.1 MB in the end (delta: 336.6 MB). Free memory was 526.7 MB in the beginning and 578.7 MB in the end (delta: -52.0 MB). Peak memory consumption was 284.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:27:45,676 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 394.8 MB. Free memory is still 353.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 276.50 ms. Allocated memory is still 394.8 MB. Free memory was 327.0 MB in the beginning and 303.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.83 ms. Allocated memory is still 394.8 MB. Free memory was 303.2 MB in the beginning and 300.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 364.37 ms. Allocated memory was 394.8 MB in the beginning and 593.5 MB in the end (delta: 198.7 MB). Free memory was 300.5 MB in the beginning and 526.7 MB in the end (delta: -226.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 30410.16 ms. Allocated memory was 593.5 MB in the beginning and 930.1 MB in the end (delta: 336.6 MB). Free memory was 526.7 MB in the beginning and 578.7 MB in the end (delta: -52.0 MB). Peak memory consumption was 284.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 15 error locations. SAFE Result, 30.3s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 18.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 958 SDtfs, 2499 SDslu, 4156 SDs, 0 SdLazy, 5119 SolverSat, 298 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 834 GetRequests, 377 SyntacticMatches, 12 SemanticMatches, 445 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1629 ImplicationChecksByTransitivity, 21.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 446 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 1331 NumberOfCodeBlocks, 1331 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 903 ConstructedInterpolants, 158 QuantifiedInterpolants, 467586 SizeOfPredicates, 188 NumberOfNonLiveVariables, 2476 ConjunctsInSsa, 545 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 50/269 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-27-45-681.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-27-45-681.csv Received shutdown request...