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/cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:09:25,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:09:25,970 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:09:25,983 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:09:25,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:09:25,984 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:09:25,985 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:09:25,987 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:09:25,989 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:09:25,989 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:09:25,990 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:09:25,990 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:09:25,991 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:09:25,992 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:09:25,993 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:09:25,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:09:25,996 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:09:25,997 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:09:25,998 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:09:25,999 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:09:26,000 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:09:26,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:09:26,001 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:09:26,002 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:09:26,002 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:09:26,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:09:26,003 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:09:26,004 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:09:26,005 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:09:26,005 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:09:26,005 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:09:26,005 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:09:26,026 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:09:26,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:09:26,027 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:09:26,027 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:09:26,028 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:09:26,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:09:26,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:09:26,028 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:09:26,028 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:09:26,028 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:09:26,028 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:09:26,029 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:09:26,029 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:09:26,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:09:26,029 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:09:26,029 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:09:26,029 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:09:26,029 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:09:26,030 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:09:26,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:09:26,030 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:09:26,030 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:09:26,030 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:09:26,030 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:09:26,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:09:26,068 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:09:26,071 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:09:26,072 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:09:26,073 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:09:26,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,387 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG332b9e103 [2018-04-11 15:09:26,514 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:09:26,514 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:09:26,514 INFO L168 CDTParser]: Scanning cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,522 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:09:26,522 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:09:26,522 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:09:26,522 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,522 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,522 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,522 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,522 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:09:26,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____key_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____u_int in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__uint in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__id_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__ushort in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__register_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__key_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____off_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__time_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__div_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____id_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_int in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____time_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__size_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____u_char in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_short in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____u_long in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__ulong in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_char in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__off_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_long in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____u_short in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:26,542 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG332b9e103 [2018-04-11 15:09:26,545 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:09:26,546 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:09:26,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:09:26,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:09:26,550 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:09:26,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:09:26" (1/1) ... [2018-04-11 15:09:26,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a83fab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:26, skipping insertion in model container [2018-04-11 15:09:26,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:09:26" (1/1) ... [2018-04-11 15:09:26,567 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:09:26,589 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:09:26,708 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:09:26,740 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:09:26,746 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 15:09:26,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:26 WrapperNode [2018-04-11 15:09:26,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:09:26,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:09:26,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:09:26,783 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:09:26,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:26" (1/1) ... [2018-04-11 15:09:26,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:26" (1/1) ... [2018-04-11 15:09:26,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:26" (1/1) ... [2018-04-11 15:09:26,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:26" (1/1) ... [2018-04-11 15:09:26,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:26" (1/1) ... [2018-04-11 15:09:26,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:26" (1/1) ... [2018-04-11 15:09:26,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:26" (1/1) ... [2018-04-11 15:09:26,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:09:26,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:09:26,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:09:26,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:09:26,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:26" (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:09:26,924 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:09:26,924 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:09:26,924 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:09:26,924 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:09:26,924 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-04-11 15:09:26,924 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:09:26,925 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:09:26,925 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:09:26,925 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:09:26,925 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:09:26,925 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:09:26,925 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:09:26,925 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:09:26,925 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:09:26,925 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:09:26,925 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:09:26,925 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:09:26,926 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:09:26,926 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:09:26,926 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:09:26,926 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:09:26,926 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:09:26,926 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:09:26,926 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:09:26,926 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:09:26,926 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:09:26,926 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:09:26,927 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:09:26,927 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:09:26,927 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:09:26,927 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:09:26,927 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:09:26,927 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:09:26,927 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:09:26,927 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:09:26,927 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:09:26,928 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:09:26,928 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:09:26,928 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:09:26,928 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:09:26,928 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:09:26,928 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:09:26,928 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:09:26,928 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:09:26,928 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:09:26,928 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:09:26,929 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:09:26,929 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:09:26,929 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:09:26,929 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:09:26,929 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:09:26,929 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:09:26,929 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:09:26,929 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:09:26,929 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:09:26,929 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:09:26,929 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:09:26,929 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:09:26,930 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:09:26,930 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:09:26,930 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:09:26,930 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:09:26,930 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:09:26,930 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:09:26,930 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:09:26,930 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:09:26,930 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:09:26,930 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:09:26,930 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:09:26,931 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:09:26,932 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:09:26,932 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:09:26,932 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:09:26,932 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:09:26,932 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:09:26,932 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:09:26,932 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:09:26,932 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:09:26,932 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:09:26,932 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:09:26,933 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:09:26,933 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:09:26,933 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:09:26,933 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:09:26,933 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:09:26,933 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:09:26,933 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:09:26,933 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:09:26,933 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:09:26,933 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:09:26,934 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:09:26,934 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:09:26,934 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-04-11 15:09:26,934 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:09:26,934 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:09:26,934 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:09:26,934 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:09:26,934 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:09:26,934 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:09:26,934 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:09:26,935 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:09:27,195 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:09:27,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:09:27 BoogieIcfgContainer [2018-04-11 15:09:27,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:09:27,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:09:27,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:09:27,198 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:09:27,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:09:26" (1/3) ... [2018-04-11 15:09:27,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b896f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:09:27, skipping insertion in model container [2018-04-11 15:09:27,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:26" (2/3) ... [2018-04-11 15:09:27,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b896f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:09:27, skipping insertion in model container [2018-04-11 15:09:27,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:09:27" (3/3) ... [2018-04-11 15:09:27,200 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:27,205 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:09:27,210 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-11 15:09:27,237 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:09:27,238 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:09:27,238 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:09:27,238 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:09:27,238 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:09:27,238 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:09:27,238 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:09:27,239 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:09:27,239 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:09:27,239 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:09:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-04-11 15:09:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:09:27,253 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:27,253 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:27,254 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:27,256 INFO L82 PathProgramCache]: Analyzing trace with hash -878219724, now seen corresponding path program 1 times [2018-04-11 15:09:27,257 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:27,257 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:27,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:27,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:27,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:27,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:27,339 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:27,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:27,339 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:27,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:27,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:27,400 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:09:27,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:27,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:27,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:09:27,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:09:27,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:27,429 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:09:27,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 15:09:27,438 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:09:27,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:27,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:09:27,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:09:27,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:09:27,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:09:27,451 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-04-11 15:09:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:27,520 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-04-11 15:09:27,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:09:27,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 15:09:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:27,529 INFO L225 Difference]: With dead ends: 60 [2018-04-11 15:09:27,529 INFO L226 Difference]: Without dead ends: 57 [2018-04-11 15:09:27,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 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:09:27,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-11 15:09:27,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-11 15:09:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 15:09:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-04-11 15:09:27,554 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2018-04-11 15:09:27,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:27,554 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-04-11 15:09:27,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:09:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-04-11 15:09:27,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:09:27,555 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:27,555 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:27,555 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:27,555 INFO L82 PathProgramCache]: Analyzing trace with hash -878219723, now seen corresponding path program 1 times [2018-04-11 15:09:27,555 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:27,555 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:27,556 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:27,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:27,556 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:27,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:27,574 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:27,574 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:27,574 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:27,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:27,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:27,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 6 treesize of output 5 [2018-04-11 15:09:27,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:27,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:27,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-11 15:09:27,641 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:09:27,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2018-04-11 15:09:27,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:27,646 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:09:27,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-04-11 15:09:27,663 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:09:27,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:27,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:09:27,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:09:27,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:09:27,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:09:27,664 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 7 states. [2018-04-11 15:09:27,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:27,774 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-04-11 15:09:27,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:09:27,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-04-11 15:09:27,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:27,777 INFO L225 Difference]: With dead ends: 93 [2018-04-11 15:09:27,777 INFO L226 Difference]: Without dead ends: 93 [2018-04-11 15:09:27,778 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:09:27,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-11 15:09:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2018-04-11 15:09:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-11 15:09:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-04-11 15:09:27,786 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 13 [2018-04-11 15:09:27,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:27,786 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-04-11 15:09:27,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:09:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-04-11 15:09:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:09:27,787 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:27,787 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:27,787 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:27,787 INFO L82 PathProgramCache]: Analyzing trace with hash -820961421, now seen corresponding path program 1 times [2018-04-11 15:09:27,787 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:27,787 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:27,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:27,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:27,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:27,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:27,805 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:27,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:27,806 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:27,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:27,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:27,835 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:09:27,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:27,843 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:09:27,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:27,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:27,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:09:27,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:27,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:27,874 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:09:27,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:27,884 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:09:27,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:27,893 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:09:27,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:09:27,917 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:09:27,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:27,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:09:27,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:09:27,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:09:27,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:09:27,919 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 6 states. [2018-04-11 15:09:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:28,001 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-04-11 15:09:28,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:09:28,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 15:09:28,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:28,002 INFO L225 Difference]: With dead ends: 80 [2018-04-11 15:09:28,002 INFO L226 Difference]: Without dead ends: 80 [2018-04-11 15:09:28,002 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:09:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-11 15:09:28,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-04-11 15:09:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-11 15:09:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-04-11 15:09:28,005 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 13 [2018-04-11 15:09:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:28,005 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-04-11 15:09:28,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:09:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-04-11 15:09:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:09:28,006 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:28,006 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:28,006 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:28,006 INFO L82 PathProgramCache]: Analyzing trace with hash 896787639, now seen corresponding path program 1 times [2018-04-11 15:09:28,006 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:28,006 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:28,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:28,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:28,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:28,021 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:28,021 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:28,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:28,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:28,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:28,050 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:09:28,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:28,057 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:09:28,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:28,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:28,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:09:28,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:28,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:28,080 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:09:28,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:28,090 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:09:28,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:28,095 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:09:28,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:09:28,113 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:09:28,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:28,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:09:28,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:09:28,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:09:28,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:09:28,114 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 6 states. [2018-04-11 15:09:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:28,192 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-04-11 15:09:28,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:09:28,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 15:09:28,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:28,193 INFO L225 Difference]: With dead ends: 62 [2018-04-11 15:09:28,193 INFO L226 Difference]: Without dead ends: 62 [2018-04-11 15:09:28,193 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:09:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-11 15:09:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-04-11 15:09:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 15:09:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-04-11 15:09:28,197 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 13 [2018-04-11 15:09:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:28,197 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-04-11 15:09:28,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:09:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-04-11 15:09:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:09:28,198 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:28,198 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:28,198 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:28,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1455007674, now seen corresponding path program 1 times [2018-04-11 15:09:28,198 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:28,198 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:28,199 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:28,199 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:28,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:28,222 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:09:28,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:28,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:09:28,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:09:28,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:09:28,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:09:28,223 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 4 states. [2018-04-11 15:09:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:28,248 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-04-11 15:09:28,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:09:28,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 15:09:28,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:28,249 INFO L225 Difference]: With dead ends: 55 [2018-04-11 15:09:28,249 INFO L226 Difference]: Without dead ends: 55 [2018-04-11 15:09:28,249 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:09:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-11 15:09:28,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-11 15:09:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:09:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-04-11 15:09:28,252 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 14 [2018-04-11 15:09:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:28,252 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-04-11 15:09:28,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:09:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-04-11 15:09:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:09:28,253 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:28,253 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:28,253 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1455007673, now seen corresponding path program 1 times [2018-04-11 15:09:28,253 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:28,253 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:28,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:28,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:28,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:28,308 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:09:28,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:28,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:09:28,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:09:28,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:09:28,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:09:28,309 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 5 states. [2018-04-11 15:09:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:28,331 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-04-11 15:09:28,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:09:28,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 15:09:28,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:28,332 INFO L225 Difference]: With dead ends: 54 [2018-04-11 15:09:28,332 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 15:09:28,332 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:09:28,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 15:09:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 15:09:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 15:09:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-04-11 15:09:28,334 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 14 [2018-04-11 15:09:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:28,334 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-04-11 15:09:28,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:09:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-04-11 15:09:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 15:09:28,334 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:28,335 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] [2018-04-11 15:09:28,335 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash 8354905, now seen corresponding path program 1 times [2018-04-11 15:09:28,335 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:28,335 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:28,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:28,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:28,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:28,366 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:09:28,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:28,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:09:28,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:09:28,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:09:28,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:09:28,368 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 5 states. [2018-04-11 15:09:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:28,410 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-04-11 15:09:28,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:09:28,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-11 15:09:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:28,411 INFO L225 Difference]: With dead ends: 51 [2018-04-11 15:09:28,411 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 15:09:28,411 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:09:28,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 15:09:28,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-11 15:09:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:09:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-04-11 15:09:28,413 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2018-04-11 15:09:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:28,413 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-04-11 15:09:28,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:09:28,414 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-04-11 15:09:28,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 15:09:28,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:28,414 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] [2018-04-11 15:09:28,414 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:28,414 INFO L82 PathProgramCache]: Analyzing trace with hash 8354906, now seen corresponding path program 1 times [2018-04-11 15:09:28,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:28,415 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:28,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:28,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:28,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:28,484 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:09:28,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:28,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:09:28,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:09:28,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:09:28,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:09:28,485 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-04-11 15:09:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:28,555 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-04-11 15:09:28,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:09:28,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-11 15:09:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:28,557 INFO L225 Difference]: With dead ends: 74 [2018-04-11 15:09:28,557 INFO L226 Difference]: Without dead ends: 74 [2018-04-11 15:09:28,557 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:09:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-11 15:09:28,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-04-11 15:09:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-11 15:09:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2018-04-11 15:09:28,561 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 22 [2018-04-11 15:09:28,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:28,561 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2018-04-11 15:09:28,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:09:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-04-11 15:09:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:09:28,562 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:28,562 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] [2018-04-11 15:09:28,562 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:28,562 INFO L82 PathProgramCache]: Analyzing trace with hash 259002080, now seen corresponding path program 1 times [2018-04-11 15:09:28,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:28,562 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:28,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:28,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:28,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:28,592 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:09:28,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:28,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:09:28,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:09:28,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:09:28,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:09:28,593 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 5 states. [2018-04-11 15:09:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:28,627 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-04-11 15:09:28,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:09:28,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-11 15:09:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:28,628 INFO L225 Difference]: With dead ends: 59 [2018-04-11 15:09:28,628 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 15:09:28,628 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:09:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 15:09:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-04-11 15:09:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-04-11 15:09:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-04-11 15:09:28,632 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 23 [2018-04-11 15:09:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:28,632 INFO L459 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-04-11 15:09:28,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:09:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-04-11 15:09:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:09:28,632 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:28,633 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] [2018-04-11 15:09:28,633 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash 259002081, now seen corresponding path program 1 times [2018-04-11 15:09:28,633 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:28,633 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:28,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:28,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:28,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:28,700 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:09:28,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:28,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:09:28,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:09:28,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:09:28,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:09:28,701 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 8 states. [2018-04-11 15:09:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:28,795 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-04-11 15:09:28,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:09:28,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-04-11 15:09:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:28,796 INFO L225 Difference]: With dead ends: 68 [2018-04-11 15:09:28,796 INFO L226 Difference]: Without dead ends: 68 [2018-04-11 15:09:28,797 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:09:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-11 15:09:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-04-11 15:09:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-11 15:09:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-04-11 15:09:28,798 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 23 [2018-04-11 15:09:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:28,799 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-04-11 15:09:28,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:09:28,799 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-04-11 15:09:28,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:09:28,800 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:28,800 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] [2018-04-11 15:09:28,803 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:28,803 INFO L82 PathProgramCache]: Analyzing trace with hash -633449795, now seen corresponding path program 1 times [2018-04-11 15:09:28,803 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:28,803 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:28,804 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:28,804 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:28,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:28,814 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:28,814 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:28,814 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:28,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:28,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:28,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:28,856 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:09:28,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:28,859 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:09:28,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:28,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:28,884 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:09:28,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:09:28,908 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc15.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc15.base| 1))) (and (= 0 (select .cse0 |c_main_#t~malloc16.base|)) (= (select |c_old(#valid)| |main_#t~malloc15.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc16.base| 1) |main_#t~malloc15.base| 0))))) is different from true [2018-04-11 15:09:28,914 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc16.base| Int) (|main_#t~malloc15.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc15.base| 1))) (and (= 0 (select .cse0 |main_#t~malloc16.base|)) (= (select |c_old(#valid)| |main_#t~malloc15.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc16.base| 1) |main_#t~malloc15.base| 0) |main_#t~malloc16.base| 0))))) is different from true [2018-04-11 15:09:28,918 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:09:28,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:28,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:09:28,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:09:28,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:09:28,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-11 15:09:28,919 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 8 states. [2018-04-11 15:09:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:28,994 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-04-11 15:09:28,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:09:28,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-04-11 15:09:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:28,995 INFO L225 Difference]: With dead ends: 60 [2018-04-11 15:09:28,995 INFO L226 Difference]: Without dead ends: 46 [2018-04-11 15:09:28,995 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 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:09:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-04-11 15:09:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-04-11 15:09:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-11 15:09:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-04-11 15:09:28,997 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 26 [2018-04-11 15:09:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:28,997 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-04-11 15:09:28,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:09:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-04-11 15:09:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:09:28,997 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:28,997 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:28,997 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:28,998 INFO L82 PathProgramCache]: Analyzing trace with hash 517212813, now seen corresponding path program 1 times [2018-04-11 15:09:28,998 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:28,998 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:28,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:28,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:28,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:29,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:29,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:29,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:09:29,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:09:29,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:09:29,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:09:29,018 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 3 states. [2018-04-11 15:09:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:29,024 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-11 15:09:29,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:09:29,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-04-11 15:09:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:29,025 INFO L225 Difference]: With dead ends: 48 [2018-04-11 15:09:29,025 INFO L226 Difference]: Without dead ends: 47 [2018-04-11 15:09:29,026 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:09:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-11 15:09:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-11 15:09:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 15:09:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-11 15:09:29,028 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 28 [2018-04-11 15:09:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:29,028 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-11 15:09:29,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:09:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-11 15:09:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:09:29,029 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:29,029 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:29,029 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:29,029 INFO L82 PathProgramCache]: Analyzing trace with hash 733581303, now seen corresponding path program 1 times [2018-04-11 15:09:29,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:29,029 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:29,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:29,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:29,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:29,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:29,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:29,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:09:29,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:09:29,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:09:29,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:09:29,074 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 3 states. [2018-04-11 15:09:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:29,078 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-04-11 15:09:29,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:09:29,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-04-11 15:09:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:29,079 INFO L225 Difference]: With dead ends: 48 [2018-04-11 15:09:29,079 INFO L226 Difference]: Without dead ends: 47 [2018-04-11 15:09:29,079 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:09:29,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-11 15:09:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-11 15:09:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 15:09:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-04-11 15:09:29,081 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2018-04-11 15:09:29,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:29,081 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-04-11 15:09:29,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:09:29,081 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-04-11 15:09:29,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:09:29,082 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:29,082 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:29,082 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:29,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2137199122, now seen corresponding path program 1 times [2018-04-11 15:09:29,082 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:29,082 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:29,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:29,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:29,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:29,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:29,101 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:29,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:29,101 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:29,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:29,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:29,135 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:09:29,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:09:29,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:29,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:29,156 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:09:29,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 15:09:29,183 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:09:29,184 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:09:29,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,193 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:09:29,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 15:09:29,216 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:09:29,219 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:09:29,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,231 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:09:29,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:36 [2018-04-11 15:09:29,332 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 28 treesize of output 26 [2018-04-11 15:09:29,334 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:09:29,334 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 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-11 15:09:29,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,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 8 treesize of output 1 [2018-04-11 15:09:29,340 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,349 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-04-11 15:09:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:29,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:29,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-11 15:09:29,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:09:29,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:09:29,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:09:29,376 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 14 states. [2018-04-11 15:09:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:29,646 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-04-11 15:09:29,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:09:29,646 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-04-11 15:09:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:29,646 INFO L225 Difference]: With dead ends: 69 [2018-04-11 15:09:29,646 INFO L226 Difference]: Without dead ends: 47 [2018-04-11 15:09:29,647 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:09:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-11 15:09:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-11 15:09:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 15:09:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-04-11 15:09:29,648 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 33 [2018-04-11 15:09:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:29,648 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-04-11 15:09:29,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:09:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-04-11 15:09:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:09:29,649 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:29,649 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:29,649 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash -234540140, now seen corresponding path program 1 times [2018-04-11 15:09:29,649 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:29,649 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:29,649 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:29,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:29,650 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:29,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:29,662 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:29,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:29,662 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:29,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:29,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:29,720 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:09:29,722 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:09:29,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,727 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:09:29,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-11 15:09:29,871 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 29 treesize of output 29 [2018-04-11 15:09:29,874 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:09:29,875 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 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-11 15:09:29,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,884 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 15 treesize of output 8 [2018-04-11 15:09:29,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,893 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:09:29,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2018-04-11 15:09:29,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:29,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:46, output treesize:3 [2018-04-11 15:09:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:29,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:29,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-11 15:09:29,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:09:29,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:09:29,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:09:29,966 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 14 states. [2018-04-11 15:09:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:30,288 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-04-11 15:09:30,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:09:30,288 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-04-11 15:09:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:30,289 INFO L225 Difference]: With dead ends: 68 [2018-04-11 15:09:30,289 INFO L226 Difference]: Without dead ends: 47 [2018-04-11 15:09:30,289 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:09:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-11 15:09:30,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-11 15:09:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 15:09:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-04-11 15:09:30,291 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 33 [2018-04-11 15:09:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:30,291 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-04-11 15:09:30,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:09:30,291 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-04-11 15:09:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:09:30,292 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:30,292 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:30,292 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:30,292 INFO L82 PathProgramCache]: Analyzing trace with hash -172500526, now seen corresponding path program 1 times [2018-04-11 15:09:30,292 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:30,292 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:30,293 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:30,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:30,293 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:30,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:30,304 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:30,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:30,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:30,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:30,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:30,331 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:09:30,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:30,337 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:09:30,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:30,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:30,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:09:30,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:30,358 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:09:30,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:30,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:30,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:30,366 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:09:30,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:30,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:30,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:09:30,385 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:09:30,390 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:09:30,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:30,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:30,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:30,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-04-11 15:09:30,410 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:09:30,413 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:09:30,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:30,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:30,422 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:09:30,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-11 15:09:30,517 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:09:30,519 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:09:30,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:30,527 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:09:30,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:30,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:09:30,539 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:09:30,540 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:54 [2018-04-11 15:09:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:30,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:30,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:09:30,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:09:30,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:09:30,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:09:30,605 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 15 states. [2018-04-11 15:09:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:31,101 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-04-11 15:09:31,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:09:31,102 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-04-11 15:09:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:31,103 INFO L225 Difference]: With dead ends: 66 [2018-04-11 15:09:31,103 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 15:09:31,103 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:09:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 15:09:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-04-11 15:09:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 15:09:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-04-11 15:09:31,105 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 33 [2018-04-11 15:09:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:31,105 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-04-11 15:09:31,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:09:31,105 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-04-11 15:09:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:09:31,105 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:31,105 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:31,105 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:31,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1052549015, now seen corresponding path program 1 times [2018-04-11 15:09:31,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:31,105 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:31,106 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:31,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:31,106 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:31,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:31,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:31,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:31,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:31,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:31,382 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:09:31,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:31,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:31,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:09:31,416 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:09:31,418 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:09:31,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:31,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:31,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:31,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:09:31,628 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 31 treesize of output 31 [2018-04-11 15:09:31,644 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:09:31,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:31,670 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 19 treesize of output 14 [2018-04-11 15:09:31,670 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:31,672 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 15 treesize of output 8 [2018-04-11 15:09:31,672 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:31,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 27 [2018-04-11 15:09:31,700 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:31,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:09:31,718 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:09:31,719 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:47, output treesize:54 [2018-04-11 15:09:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:31,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:09:31,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2018-04-11 15:09:31,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:09:31,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:09:31,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:09:31,796 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 27 states. [2018-04-11 15:09:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:32,349 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-04-11 15:09:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:09:32,349 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-04-11 15:09:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:32,350 INFO L225 Difference]: With dead ends: 64 [2018-04-11 15:09:32,350 INFO L226 Difference]: Without dead ends: 60 [2018-04-11 15:09:32,351 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=1215, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:09:32,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-11 15:09:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-04-11 15:09:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-11 15:09:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-04-11 15:09:32,352 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 34 [2018-04-11 15:09:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:32,353 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-04-11 15:09:32,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:09:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-04-11 15:09:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:09:32,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:32,353 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-04-11 15:09:32,353 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:32,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1148970598, now seen corresponding path program 2 times [2018-04-11 15:09:32,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:32,354 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:32,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:32,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:32,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:32,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:32,378 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:32,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:32,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:32,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:09:32,407 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:09:32,407 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:32,411 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:32,417 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:09:32,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:32,424 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:09:32,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:32,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:32,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:32,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:32,441 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:09:32,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:32,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:32,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:32,467 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:09:32,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:32,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:32,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:09:32,487 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:09:32,488 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:09:32,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:32,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:32,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:32,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-04-11 15:09:32,507 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:09:32,509 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:09:32,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:32,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:32,517 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:09:32,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-04-11 15:09:32,632 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:09:32,637 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:09:32,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:32,643 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:09:32,644 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:32,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:09:32,652 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:09:32,653 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2018-04-11 15:09:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:32,720 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:32,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:09:32,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:09:32,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:09:32,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:09:32,721 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 16 states. [2018-04-11 15:09:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:33,256 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-04-11 15:09:33,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:09:33,256 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-04-11 15:09:33,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:33,257 INFO L225 Difference]: With dead ends: 77 [2018-04-11 15:09:33,257 INFO L226 Difference]: Without dead ends: 77 [2018-04-11 15:09:33,257 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:09:33,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-11 15:09:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2018-04-11 15:09:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-11 15:09:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-04-11 15:09:33,258 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 44 [2018-04-11 15:09:33,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:33,259 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-04-11 15:09:33,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:09:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-04-11 15:09:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 15:09:33,259 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:33,259 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-04-11 15:09:33,259 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:33,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1258350175, now seen corresponding path program 2 times [2018-04-11 15:09:33,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:33,260 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:33,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:33,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:33,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:33,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:33,543 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:33,543 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:33,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:09:33,562 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:09:33,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:33,567 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:33,572 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:09:33,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:33,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:33,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:09:33,581 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:09:33,582 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:09:33,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:33,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:33,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:33,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 15:09:33,730 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 30 treesize of output 30 [2018-04-11 15:09:33,734 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 26 treesize of output 24 [2018-04-11 15:09:33,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:33,745 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 18 treesize of output 13 [2018-04-11 15:09:33,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:33,746 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 15 treesize of output 8 [2018-04-11 15:09:33,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:33,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 15:09:33,763 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:33,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:09:33,778 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:09:33,779 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-04-11 15:09:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:33,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:09:33,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-04-11 15:09:33,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:09:33,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:09:33,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:09:33,843 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 26 states. [2018-04-11 15:09:34,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:34,221 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-04-11 15:09:34,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:09:34,278 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-04-11 15:09:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:34,278 INFO L225 Difference]: With dead ends: 75 [2018-04-11 15:09:34,278 INFO L226 Difference]: Without dead ends: 71 [2018-04-11 15:09:34,279 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:09:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-11 15:09:34,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-04-11 15:09:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-11 15:09:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-04-11 15:09:34,281 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 45 [2018-04-11 15:09:34,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:34,281 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-04-11 15:09:34,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:09:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-04-11 15:09:34,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 15:09:34,282 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:34,282 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2018-04-11 15:09:34,282 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:34,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1488170194, now seen corresponding path program 3 times [2018-04-11 15:09:34,282 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:34,282 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:34,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:34,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:34,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:34,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:34,306 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:34,307 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:34,307 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:34,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:09:34,342 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:09:34,342 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:34,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:34,353 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:09:34,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:34,359 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:09:34,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:34,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:34,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:34,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:34,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:34,377 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:09:34,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:34,382 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:09:34,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:34,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:34,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:09:34,402 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 5 treesize of output 1 [2018-04-11 15:09:34,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:34,407 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:09:34,408 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:09:34,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:34,410 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:34,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:34,413 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:21 [2018-04-11 15:09:34,424 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:09:34,426 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:09:34,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:34,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:34,433 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:09:34,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-11 15:09:34,492 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:09:34,499 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:09:34,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:34,507 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:09:34,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:34,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:09:34,517 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:09:34,517 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-11 15:09:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-04-11 15:09:34,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:34,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 15:09:34,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:09:34,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:09:34,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:09:34,597 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 13 states. [2018-04-11 15:09:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:35,070 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-04-11 15:09:35,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:09:35,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-04-11 15:09:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:35,071 INFO L225 Difference]: With dead ends: 66 [2018-04-11 15:09:35,071 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 15:09:35,071 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:09:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 15:09:35,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-04-11 15:09:35,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-11 15:09:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-04-11 15:09:35,073 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 55 [2018-04-11 15:09:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:35,073 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-04-11 15:09:35,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:09:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-04-11 15:09:35,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 15:09:35,074 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:35,074 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-04-11 15:09:35,074 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-11 15:09:35,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1111364247, now seen corresponding path program 3 times [2018-04-11 15:09:35,074 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:35,074 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:35,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:35,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:35,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:35,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-11 15:09:35,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:35,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:35,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:09:35,343 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:09:35,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:35,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:35,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 6 treesize of output 5 [2018-04-11 15:09:35,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:35,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:35,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:09:35,365 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:09:35,367 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:09:35,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:35,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:35,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:35,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-11 15:09:35,521 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 30 treesize of output 30 [2018-04-11 15:09:35,530 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 26 treesize of output 24 [2018-04-11 15:09:35,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:35,548 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 18 treesize of output 13 [2018-04-11 15:09:35,548 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:35,550 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 15 treesize of output 8 [2018-04-11 15:09:35,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:35,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 15:09:35,576 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:35,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:09:35,601 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:09:35,601 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-04-11 15:09:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-04-11 15:09:35,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:09:35,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-04-11 15:09:35,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:09:35,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:09:35,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:09:35,681 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 22 states. [2018-04-11 15:09:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:36,137 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-04-11 15:09:36,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:09:36,138 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2018-04-11 15:09:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:36,138 INFO L225 Difference]: With dead ends: 62 [2018-04-11 15:09:36,138 INFO L226 Difference]: Without dead ends: 0 [2018-04-11 15:09:36,138 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=1219, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:09:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-11 15:09:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-11 15:09:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-11 15:09:36,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-11 15:09:36,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-04-11 15:09:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:36,139 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-11 15:09:36,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:09:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-11 15:09:36,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-11 15:09:36,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:09:36 BoogieIcfgContainer [2018-04-11 15:09:36,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:09:36,142 INFO L168 Benchmark]: Toolchain (without parser) took 9597.06 ms. Allocated memory was 403.7 MB in the beginning and 828.9 MB in the end (delta: 425.2 MB). Free memory was 337.7 MB in the beginning and 737.9 MB in the end (delta: -400.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. [2018-04-11 15:09:36,143 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 403.7 MB. Free memory is still 363.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:09:36,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.25 ms. Allocated memory is still 403.7 MB. Free memory was 336.3 MB in the beginning and 311.9 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 5.3 GB. [2018-04-11 15:09:36,144 INFO L168 Benchmark]: Boogie Preprocessor took 39.87 ms. Allocated memory is still 403.7 MB. Free memory was 311.9 MB in the beginning and 309.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:09:36,144 INFO L168 Benchmark]: RCFGBuilder took 372.10 ms. Allocated memory was 403.7 MB in the beginning and 617.6 MB in the end (delta: 213.9 MB). Free memory was 309.3 MB in the beginning and 550.4 MB in the end (delta: -241.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 5.3 GB. [2018-04-11 15:09:36,144 INFO L168 Benchmark]: TraceAbstraction took 8946.32 ms. Allocated memory was 617.6 MB in the beginning and 828.9 MB in the end (delta: 211.3 MB). Free memory was 550.4 MB in the beginning and 737.9 MB in the end (delta: -187.5 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 15:09:36,145 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.21 ms. Allocated memory is still 403.7 MB. Free memory is still 363.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 236.25 ms. Allocated memory is still 403.7 MB. Free memory was 336.3 MB in the beginning and 311.9 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.87 ms. Allocated memory is still 403.7 MB. Free memory was 311.9 MB in the beginning and 309.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 372.10 ms. Allocated memory was 403.7 MB in the beginning and 617.6 MB in the end (delta: 213.9 MB). Free memory was 309.3 MB in the beginning and 550.4 MB in the end (delta: -241.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8946.32 ms. Allocated memory was 617.6 MB in the beginning and 828.9 MB in the end (delta: 211.3 MB). Free memory was 550.4 MB in the beginning and 737.9 MB in the end (delta: -187.5 MB). Peak memory consumption was 23.8 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: 545]: 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: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: 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: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: 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, 67 locations, 15 error locations. SAFE Result, 8.9s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 864 SDtfs, 1102 SDslu, 3456 SDs, 0 SdLazy, 2925 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 581 GetRequests, 288 SyntacticMatches, 11 SemanticMatches, 282 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=18, 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, 21 MinimizatonAttempts, 91 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 999 NumberOfCodeBlocks, 999 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 699 ConstructedInterpolants, 118 QuantifiedInterpolants, 373916 SizeOfPredicates, 110 NumberOfNonLiveVariables, 1751 ConjunctsInSsa, 315 ConjunctsInUnsatCore, 24 InterpolantComputations, 15 PerfectInterpolantSequences, 84/231 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/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-09-36-149.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-09-36-149.csv Received shutdown request...