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/cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 03:53:21,790 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 03:53:21,792 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 03:53:21,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 03:53:21,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 03:53:21,804 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 03:53:21,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 03:53:21,806 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 03:53:21,808 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 03:53:21,809 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 03:53:21,810 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 03:53:21,810 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 03:53:21,811 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 03:53:21,812 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 03:53:21,813 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 03:53:21,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 03:53:21,816 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 03:53:21,817 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 03:53:21,818 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 03:53:21,819 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 03:53:21,821 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 03:53:21,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 03:53:21,821 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 03:53:21,822 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 03:53:21,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 03:53:21,824 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 03:53:21,824 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 03:53:21,825 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 03:53:21,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 03:53:21,826 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 03:53:21,826 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 03:53:21,826 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-13 03:53:21,837 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 03:53:21,837 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 03:53:21,838 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 03:53:21,838 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 03:53:21,838 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 03:53:21,839 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 03:53:21,839 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 03:53:21,839 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 03:53:21,839 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 03:53:21,839 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 03:53:21,839 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 03:53:21,839 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 03:53:21,840 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 03:53:21,840 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 03:53:21,840 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 03:53:21,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 03:53:21,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 03:53:21,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 03:53:21,841 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 03:53:21,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 03:53:21,841 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 03:53:21,841 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 03:53:21,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 03:53:21,841 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 03:53:21,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 03:53:21,883 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 03:53:21,886 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 03:53:21,888 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 03:53:21,888 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 03:53:21,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,209 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcccd4cd1f [2018-04-13 03:53:22,341 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 03:53:22,341 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 03:53:22,341 INFO L168 CDTParser]: Scanning cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,348 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 03:53:22,349 INFO L215 ultiparseSymbolTable]: [2018-04-13 03:53:22,349 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 03:53:22,349 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,349 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,349 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,349 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,349 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 03:53:22,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_short in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__size_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____time_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,352 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____id_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,352 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,352 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,352 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,352 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,352 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,352 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,352 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,352 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,352 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,353 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,353 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,353 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,353 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,353 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,353 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,353 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,353 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,353 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,353 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,353 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,354 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_int in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,354 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,354 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__id_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,354 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,354 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,354 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,354 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,354 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,354 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__time_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,354 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__register_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,354 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,355 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ushort in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__uint in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____off_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_long in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ulong in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_long in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_char in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_short in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__div_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_char in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__off_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:22,372 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcccd4cd1f [2018-04-13 03:53:22,375 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 03:53:22,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 03:53:22,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 03:53:22,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 03:53:22,380 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 03:53:22,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:53:22" (1/1) ... [2018-04-13 03:53:22,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12874d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:22, skipping insertion in model container [2018-04-13 03:53:22,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:53:22" (1/1) ... [2018-04-13 03:53:22,397 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:53:22,418 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:53:22,547 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:53:22,579 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:53:22,585 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-13 03:53:22,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:22 WrapperNode [2018-04-13 03:53:22,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 03:53:22,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 03:53:22,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 03:53:22,621 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 03:53:22,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:22" (1/1) ... [2018-04-13 03:53:22,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:22" (1/1) ... [2018-04-13 03:53:22,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:22" (1/1) ... [2018-04-13 03:53:22,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:22" (1/1) ... [2018-04-13 03:53:22,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:22" (1/1) ... [2018-04-13 03:53:22,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:22" (1/1) ... [2018-04-13 03:53:22,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:22" (1/1) ... [2018-04-13 03:53:22,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 03:53:22,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 03:53:22,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 03:53:22,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 03:53:22,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:22" (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-13 03:53:22,745 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 03:53:22,745 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 03:53:22,745 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 03:53:22,745 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 03:53:22,745 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-04-13 03:53:22,745 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 03:53:22,745 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 03:53:22,745 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 03:53:22,745 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 03:53:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 03:53:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 03:53:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 03:53:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 03:53:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 03:53:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 03:53:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 03:53:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 03:53:22,746 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 03:53:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 03:53:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 03:53:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 03:53:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 03:53:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 03:53:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 03:53:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 03:53:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 03:53:22,747 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 03:53:22,748 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 03:53:22,748 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 03:53:22,748 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 03:53:22,748 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 03:53:22,748 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 03:53:22,748 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 03:53:22,748 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 03:53:22,748 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 03:53:22,748 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 03:53:22,748 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 03:53:22,749 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 03:53:22,749 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 03:53:22,749 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 03:53:22,749 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 03:53:22,749 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 03:53:22,749 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 03:53:22,749 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 03:53:22,749 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 03:53:22,749 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 03:53:22,750 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 03:53:22,750 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 03:53:22,750 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 03:53:22,750 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 03:53:22,750 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 03:53:22,750 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 03:53:22,750 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 03:53:22,750 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 03:53:22,750 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 03:53:22,751 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 03:53:22,751 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 03:53:22,751 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 03:53:22,751 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 03:53:22,751 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 03:53:22,751 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 03:53:22,751 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 03:53:22,751 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 03:53:22,751 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 03:53:22,751 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 03:53:22,751 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 03:53:22,752 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 03:53:22,752 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 03:53:22,752 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 03:53:22,752 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 03:53:22,752 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 03:53:22,752 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 03:53:22,752 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 03:53:22,752 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 03:53:22,752 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 03:53:22,752 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 03:53:22,752 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 03:53:22,753 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 03:53:22,753 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 03:53:22,753 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 03:53:22,753 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 03:53:22,753 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 03:53:22,753 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 03:53:22,753 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 03:53:22,753 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 03:53:22,753 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 03:53:22,753 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 03:53:22,754 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 03:53:22,754 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 03:53:22,754 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 03:53:22,754 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 03:53:22,754 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 03:53:22,754 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 03:53:22,754 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 03:53:22,754 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 03:53:22,754 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 03:53:22,754 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 03:53:22,755 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 03:53:22,755 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 03:53:22,755 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 03:53:22,755 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 03:53:22,755 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 03:53:22,755 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 03:53:22,755 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 03:53:22,755 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 03:53:22,755 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 03:53:22,755 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 03:53:22,756 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 03:53:22,756 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 03:53:22,756 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-04-13 03:53:22,756 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 03:53:22,756 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 03:53:22,756 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 03:53:22,756 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 03:53:22,756 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 03:53:22,756 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 03:53:22,756 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 03:53:22,756 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 03:53:23,007 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 03:53:23,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:53:23 BoogieIcfgContainer [2018-04-13 03:53:23,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 03:53:23,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 03:53:23,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 03:53:23,010 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 03:53:23,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 03:53:22" (1/3) ... [2018-04-13 03:53:23,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23955ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:53:23, skipping insertion in model container [2018-04-13 03:53:23,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:22" (2/3) ... [2018-04-13 03:53:23,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23955ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:53:23, skipping insertion in model container [2018-04-13 03:53:23,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:53:23" (3/3) ... [2018-04-13 03:53:23,013 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:23,020 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 03:53:23,025 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-04-13 03:53:23,054 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 03:53:23,055 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 03:53:23,055 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 03:53:23,055 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 03:53:23,055 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 03:53:23,055 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 03:53:23,055 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 03:53:23,055 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 03:53:23,055 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 03:53:23,056 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 03:53:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-04-13 03:53:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 03:53:23,068 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:23,069 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:23,069 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:23,071 INFO L82 PathProgramCache]: Analyzing trace with hash -441767553, now seen corresponding path program 1 times [2018-04-13 03:53:23,072 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:23,073 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:23,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:23,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:23,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:23,134 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:23,170 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-13 03:53:23,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:23,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:53:23,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 03:53:23,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 03:53:23,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 03:53:23,183 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2018-04-13 03:53:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:23,263 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-04-13 03:53:23,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 03:53:23,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-13 03:53:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:23,272 INFO L225 Difference]: With dead ends: 45 [2018-04-13 03:53:23,272 INFO L226 Difference]: Without dead ends: 42 [2018-04-13 03:53:23,274 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-13 03:53:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-04-13 03:53:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-04-13 03:53:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-04-13 03:53:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-04-13 03:53:23,297 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-04-13 03:53:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:23,297 INFO L459 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-04-13 03:53:23,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 03:53:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-04-13 03:53:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 03:53:23,298 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:23,298 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:23,298 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:23,298 INFO L82 PathProgramCache]: Analyzing trace with hash -441767552, now seen corresponding path program 1 times [2018-04-13 03:53:23,298 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:23,298 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:23,299 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:23,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:23,299 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:23,312 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:23,378 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-13 03:53:23,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:23,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:53:23,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:53:23,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:53:23,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:53:23,381 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-04-13 03:53:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:23,415 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-04-13 03:53:23,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:53:23,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-13 03:53:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:23,416 INFO L225 Difference]: With dead ends: 41 [2018-04-13 03:53:23,416 INFO L226 Difference]: Without dead ends: 41 [2018-04-13 03:53:23,417 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-13 03:53:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-04-13 03:53:23,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-04-13 03:53:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-04-13 03:53:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-04-13 03:53:23,419 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 13 [2018-04-13 03:53:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:23,420 INFO L459 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-04-13 03:53:23,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:53:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-04-13 03:53:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 03:53:23,420 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:23,420 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:23,421 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1083273766, now seen corresponding path program 1 times [2018-04-13 03:53:23,421 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:23,421 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:23,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:23,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:23,422 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:23,436 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:23,464 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-13 03:53:23,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:23,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:53:23,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:53:23,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:53:23,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:53:23,465 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2018-04-13 03:53:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:23,510 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-04-13 03:53:23,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:53:23,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-13 03:53:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:23,511 INFO L225 Difference]: With dead ends: 40 [2018-04-13 03:53:23,511 INFO L226 Difference]: Without dead ends: 40 [2018-04-13 03:53:23,512 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:53:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-04-13 03:53:23,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-04-13 03:53:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-04-13 03:53:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-04-13 03:53:23,514 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2018-04-13 03:53:23,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:23,514 INFO L459 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-04-13 03:53:23,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:53:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-04-13 03:53:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 03:53:23,514 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:23,515 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:23,515 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:23,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1083273765, now seen corresponding path program 1 times [2018-04-13 03:53:23,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:23,515 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:23,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:23,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:23,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:23,530 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:23,600 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-13 03:53:23,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:23,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 03:53:23,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 03:53:23,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 03:53:23,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-13 03:53:23,601 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 9 states. [2018-04-13 03:53:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:23,686 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-04-13 03:53:23,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:53:23,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-04-13 03:53:23,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:23,689 INFO L225 Difference]: With dead ends: 50 [2018-04-13 03:53:23,689 INFO L226 Difference]: Without dead ends: 50 [2018-04-13 03:53:23,689 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-13 03:53:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-13 03:53:23,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-04-13 03:53:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-13 03:53:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-04-13 03:53:23,692 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2018-04-13 03:53:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:23,692 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-04-13 03:53:23,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 03:53:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-04-13 03:53:23,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 03:53:23,692 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:23,692 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:23,693 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:23,693 INFO L82 PathProgramCache]: Analyzing trace with hash 778251610, now seen corresponding path program 1 times [2018-04-13 03:53:23,693 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:23,693 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:23,693 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:23,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:23,694 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:23,705 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:23,711 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:23,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:23,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:23,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:23,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:23,772 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-13 03:53:23,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:23,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:23,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 03:53:23,786 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-13 03:53:23,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:23,793 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-13 03:53:23,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-13 03:53:23,813 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-13 03:53:23,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:23,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 03:53:23,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 03:53:23,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 03:53:23,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:53:23,814 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-04-13 03:53:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:23,891 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-04-13 03:53:23,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 03:53:23,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-04-13 03:53:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:23,893 INFO L225 Difference]: With dead ends: 42 [2018-04-13 03:53:23,894 INFO L226 Difference]: Without dead ends: 42 [2018-04-13 03:53:23,894 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-04-13 03:53:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-04-13 03:53:23,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-04-13 03:53:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-04-13 03:53:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-04-13 03:53:23,896 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2018-04-13 03:53:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:23,896 INFO L459 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-04-13 03:53:23,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 03:53:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-04-13 03:53:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 03:53:23,896 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:23,896 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:23,897 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:23,897 INFO L82 PathProgramCache]: Analyzing trace with hash 778251611, now seen corresponding path program 1 times [2018-04-13 03:53:23,897 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:23,897 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:23,897 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:23,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:23,897 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:23,905 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:23,907 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:23,907 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:23,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:23,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:23,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:23,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:23,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:23,968 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-13 03:53:23,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:23,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:23,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-13 03:53:23,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:23,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:23,999 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-13 03:53:23,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:24,008 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-13 03:53:24,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:24,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:24,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-13 03:53:24,159 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-13 03:53:24,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:24,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-13 03:53:24,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 03:53:24,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 03:53:24,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-04-13 03:53:24,160 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 13 states. [2018-04-13 03:53:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:24,565 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-04-13 03:53:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 03:53:24,566 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-04-13 03:53:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:24,566 INFO L225 Difference]: With dead ends: 82 [2018-04-13 03:53:24,566 INFO L226 Difference]: Without dead ends: 82 [2018-04-13 03:53:24,567 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:53:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-13 03:53:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2018-04-13 03:53:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-13 03:53:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2018-04-13 03:53:24,570 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 19 [2018-04-13 03:53:24,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:24,570 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2018-04-13 03:53:24,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 03:53:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2018-04-13 03:53:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 03:53:24,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:24,571 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:24,571 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:24,571 INFO L82 PathProgramCache]: Analyzing trace with hash 191445597, now seen corresponding path program 1 times [2018-04-13 03:53:24,571 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:24,571 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:24,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:24,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:24,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:24,578 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:24,580 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:24,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:24,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:24,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:24,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:24,624 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-13 03:53:24,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:24,630 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-13 03:53:24,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:24,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:24,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 03:53:24,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:24,649 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-13 03:53:24,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:24,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:24,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:24,656 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-13 03:53:24,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:24,659 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-13 03:53:24,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:24,680 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-13 03:53:24,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:24,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 03:53:24,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 03:53:24,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 03:53:24,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-13 03:53:24,681 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand 9 states. [2018-04-13 03:53:24,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:24,776 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-04-13 03:53:24,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:53:24,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-04-13 03:53:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:24,777 INFO L225 Difference]: With dead ends: 76 [2018-04-13 03:53:24,777 INFO L226 Difference]: Without dead ends: 76 [2018-04-13 03:53:24,777 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:53:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-13 03:53:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 43. [2018-04-13 03:53:24,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-13 03:53:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-04-13 03:53:24,780 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-04-13 03:53:24,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:24,780 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-04-13 03:53:24,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 03:53:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-04-13 03:53:24,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 03:53:24,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:24,780 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] [2018-04-13 03:53:24,781 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:24,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1006730087, now seen corresponding path program 1 times [2018-04-13 03:53:24,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:24,781 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:24,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:24,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:24,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:24,791 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:24,820 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-13 03:53:24,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:24,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 03:53:24,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:53:24,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:53:24,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:53:24,821 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 6 states. [2018-04-13 03:53:24,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:24,845 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-04-13 03:53:24,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 03:53:24,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-04-13 03:53:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:24,846 INFO L225 Difference]: With dead ends: 77 [2018-04-13 03:53:24,846 INFO L226 Difference]: Without dead ends: 77 [2018-04-13 03:53:24,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:53:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-13 03:53:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-04-13 03:53:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-13 03:53:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-04-13 03:53:24,850 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 23 [2018-04-13 03:53:24,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:24,850 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-04-13 03:53:24,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:53:24,850 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-04-13 03:53:24,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 03:53:24,851 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:24,851 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] [2018-04-13 03:53:24,851 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:24,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2027798441, now seen corresponding path program 1 times [2018-04-13 03:53:24,851 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:24,851 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:24,852 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:24,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:24,852 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:24,862 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:24,959 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-13 03:53:24,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:24,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 03:53:24,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 03:53:24,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 03:53:24,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-13 03:53:24,960 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 10 states. [2018-04-13 03:53:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:25,070 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2018-04-13 03:53:25,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 03:53:25,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-04-13 03:53:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:25,071 INFO L225 Difference]: With dead ends: 121 [2018-04-13 03:53:25,071 INFO L226 Difference]: Without dead ends: 121 [2018-04-13 03:53:25,072 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:53:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-13 03:53:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2018-04-13 03:53:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-13 03:53:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2018-04-13 03:53:25,076 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 23 [2018-04-13 03:53:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:25,076 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2018-04-13 03:53:25,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 03:53:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2018-04-13 03:53:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 03:53:25,077 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:25,077 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] [2018-04-13 03:53:25,078 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:25,078 INFO L82 PathProgramCache]: Analyzing trace with hash 678820953, now seen corresponding path program 1 times [2018-04-13 03:53:25,078 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:25,078 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:25,079 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:25,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:25,079 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:25,088 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:25,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:25,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:25,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:25,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:25,221 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-13 03:53:25,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:25,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:25,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 03:53:25,247 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-13 03:53:25,249 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-13 03:53:25,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:25,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:25,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:25,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 03:53:25,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-13 03:53:25,374 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 18 treesize of output 15 [2018-04-13 03:53:25,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:25,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:25,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:25,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-04-13 03:53:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:25,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:53:25,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-04-13 03:53:25,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:53:25,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:53:25,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:53:25,491 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 21 states. [2018-04-13 03:53:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:25,871 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2018-04-13 03:53:25,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:53:25,871 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2018-04-13 03:53:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:25,873 INFO L225 Difference]: With dead ends: 115 [2018-04-13 03:53:25,873 INFO L226 Difference]: Without dead ends: 115 [2018-04-13 03:53:25,873 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:53:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-13 03:53:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2018-04-13 03:53:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-13 03:53:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2018-04-13 03:53:25,878 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 23 [2018-04-13 03:53:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:25,878 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2018-04-13 03:53:25,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:53:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2018-04-13 03:53:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 03:53:25,878 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:25,879 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] [2018-04-13 03:53:25,879 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:25,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1161751038, now seen corresponding path program 1 times [2018-04-13 03:53:25,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:25,879 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:25,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:25,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:25,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:25,887 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:25,908 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-13 03:53:25,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:25,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:53:25,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:53:25,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:53:25,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:53:25,909 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand 6 states. [2018-04-13 03:53:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:25,951 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-04-13 03:53:25,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 03:53:25,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-13 03:53:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:25,952 INFO L225 Difference]: With dead ends: 104 [2018-04-13 03:53:25,952 INFO L226 Difference]: Without dead ends: 104 [2018-04-13 03:53:25,952 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-13 03:53:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-13 03:53:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-04-13 03:53:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-13 03:53:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2018-04-13 03:53:25,956 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 24 [2018-04-13 03:53:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:25,956 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2018-04-13 03:53:25,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:53:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2018-04-13 03:53:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 03:53:25,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:25,957 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] [2018-04-13 03:53:25,957 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:25,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1161751037, now seen corresponding path program 1 times [2018-04-13 03:53:25,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:25,958 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:25,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:25,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:25,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:25,964 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:26,025 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-13 03:53:26,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:26,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 03:53:26,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:53:26,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:53:26,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:53:26,026 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 8 states. [2018-04-13 03:53:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:26,086 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-04-13 03:53:26,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 03:53:26,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-04-13 03:53:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:26,087 INFO L225 Difference]: With dead ends: 112 [2018-04-13 03:53:26,087 INFO L226 Difference]: Without dead ends: 112 [2018-04-13 03:53:26,088 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-04-13 03:53:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-13 03:53:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2018-04-13 03:53:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-13 03:53:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-04-13 03:53:26,091 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2018-04-13 03:53:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:26,091 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-04-13 03:53:26,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:53:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-04-13 03:53:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 03:53:26,092 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:26,092 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] [2018-04-13 03:53:26,092 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:26,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1544868357, now seen corresponding path program 1 times [2018-04-13 03:53:26,092 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:26,092 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:26,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:26,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:26,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:26,099 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:26,103 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:26,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:26,104 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:26,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:26,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:26,132 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-13 03:53:26,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,137 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-13 03:53:26,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:26,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:26,149 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-13 03:53:26,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:26,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:26,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-13 03:53:26,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,159 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-13 03:53:26,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:26,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-13 03:53:26,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:26,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-13 03:53:26,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 03:53:26,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 03:53:26,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-04-13 03:53:26,223 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 12 states. [2018-04-13 03:53:26,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:26,422 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2018-04-13 03:53:26,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 03:53:26,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-04-13 03:53:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:26,423 INFO L225 Difference]: With dead ends: 130 [2018-04-13 03:53:26,423 INFO L226 Difference]: Without dead ends: 130 [2018-04-13 03:53:26,423 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:53:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-13 03:53:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 113. [2018-04-13 03:53:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-13 03:53:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-04-13 03:53:26,426 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 24 [2018-04-13 03:53:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:26,426 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-04-13 03:53:26,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 03:53:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-04-13 03:53:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 03:53:26,427 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:26,427 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] [2018-04-13 03:53:26,427 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:26,427 INFO L82 PathProgramCache]: Analyzing trace with hash -431386979, now seen corresponding path program 1 times [2018-04-13 03:53:26,427 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:26,427 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:26,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:26,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:26,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:26,434 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:26,437 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:26,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:26,438 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:26,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:26,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:26,462 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-13 03:53:26,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,468 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-13 03:53:26,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:26,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:26,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:26,491 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-13 03:53:26,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,496 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-13 03:53:26,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,502 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-13 03:53:26,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:26,551 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-13 03:53:26,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:26,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-13 03:53:26,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 03:53:26,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 03:53:26,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-04-13 03:53:26,552 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 10 states. [2018-04-13 03:53:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:26,771 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2018-04-13 03:53:26,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 03:53:26,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-04-13 03:53:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:26,772 INFO L225 Difference]: With dead ends: 130 [2018-04-13 03:53:26,772 INFO L226 Difference]: Without dead ends: 130 [2018-04-13 03:53:26,772 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:53:26,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-13 03:53:26,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 114. [2018-04-13 03:53:26,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-13 03:53:26,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-04-13 03:53:26,776 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 24 [2018-04-13 03:53:26,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:26,776 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-04-13 03:53:26,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 03:53:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-04-13 03:53:26,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 03:53:26,777 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:26,777 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-13 03:53:26,777 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:26,777 INFO L82 PathProgramCache]: Analyzing trace with hash 675191908, now seen corresponding path program 1 times [2018-04-13 03:53:26,778 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:26,778 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:26,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:26,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:26,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:26,782 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:26,796 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-13 03:53:26,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:26,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:53:26,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:53:26,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:53:26,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:53:26,797 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 5 states. [2018-04-13 03:53:26,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:26,820 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2018-04-13 03:53:26,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:53:26,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-13 03:53:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:26,821 INFO L225 Difference]: With dead ends: 120 [2018-04-13 03:53:26,822 INFO L226 Difference]: Without dead ends: 114 [2018-04-13 03:53:26,822 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-13 03:53:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-13 03:53:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-04-13 03:53:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-13 03:53:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2018-04-13 03:53:26,825 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 26 [2018-04-13 03:53:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:26,825 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2018-04-13 03:53:26,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:53:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2018-04-13 03:53:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 03:53:26,826 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:26,826 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:26,826 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:26,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1936618715, now seen corresponding path program 2 times [2018-04-13 03:53:26,827 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:26,827 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:26,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:26,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:26,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:26,835 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:26,840 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:26,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:26,841 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:26,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:53:26,882 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:53:26,882 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:26,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:26,891 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-13 03:53:26,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 03:53:26,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:26,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:26,902 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-13 03:53:26,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:26,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 03:53:26,929 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-13 03:53:26,933 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-13 03:53:26,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-13 03:53:26,984 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 23 treesize of output 24 [2018-04-13 03:53:26,986 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 8 treesize of output 7 [2018-04-13 03:53:26,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:26,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-13 03:53:27,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 03:53:27,020 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-13 03:53:27,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:27,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:27,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:27,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-04-13 03:53:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:27,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:27,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 03:53:27,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 03:53:27,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 03:53:27,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:53:27,067 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 16 states. [2018-04-13 03:53:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:27,352 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2018-04-13 03:53:27,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 03:53:27,352 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-04-13 03:53:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:27,353 INFO L225 Difference]: With dead ends: 133 [2018-04-13 03:53:27,353 INFO L226 Difference]: Without dead ends: 133 [2018-04-13 03:53:27,353 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:53:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-13 03:53:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 118. [2018-04-13 03:53:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-13 03:53:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2018-04-13 03:53:27,355 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 28 [2018-04-13 03:53:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:27,355 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2018-04-13 03:53:27,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 03:53:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2018-04-13 03:53:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 03:53:27,356 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:27,356 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] [2018-04-13 03:53:27,356 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:27,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1902193704, now seen corresponding path program 1 times [2018-04-13 03:53:27,356 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:27,356 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:27,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:27,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:27,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:27,361 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:27,364 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:27,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:27,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:27,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:27,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:27,431 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-13 03:53:27,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:27,447 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-13 03:53:27,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:27,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:27,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:27,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:27,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:27,469 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-13 03:53:27,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:27,482 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-13 03:53:27,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:27,489 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-13 03:53:27,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:27,638 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-13 03:53:27,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:27,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 03:53:27,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 03:53:27,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 03:53:27,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-04-13 03:53:27,640 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 15 states. [2018-04-13 03:53:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:28,047 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2018-04-13 03:53:28,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 03:53:28,048 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-04-13 03:53:28,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:28,048 INFO L225 Difference]: With dead ends: 148 [2018-04-13 03:53:28,048 INFO L226 Difference]: Without dead ends: 148 [2018-04-13 03:53:28,049 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:53:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-13 03:53:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 128. [2018-04-13 03:53:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-13 03:53:28,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2018-04-13 03:53:28,052 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 29 [2018-04-13 03:53:28,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:28,052 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2018-04-13 03:53:28,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 03:53:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2018-04-13 03:53:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 03:53:28,053 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:28,053 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] [2018-04-13 03:53:28,053 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:28,053 INFO L82 PathProgramCache]: Analyzing trace with hash -112251391, now seen corresponding path program 1 times [2018-04-13 03:53:28,053 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:28,053 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:28,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:28,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:28,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:28,070 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:28,075 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:28,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:28,075 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:28,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:28,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:28,104 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-13 03:53:28,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,109 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-13 03:53:28,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:28,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:28,132 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-13 03:53:28,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:28,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:28,142 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-13 03:53:28,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,148 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-13 03:53:28,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:28,237 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-13 03:53:28,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:28,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 03:53:28,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 03:53:28,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 03:53:28,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-13 03:53:28,238 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 13 states. [2018-04-13 03:53:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:28,461 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2018-04-13 03:53:28,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 03:53:28,462 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-04-13 03:53:28,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:28,462 INFO L225 Difference]: With dead ends: 151 [2018-04-13 03:53:28,462 INFO L226 Difference]: Without dead ends: 151 [2018-04-13 03:53:28,463 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:53:28,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-13 03:53:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 128. [2018-04-13 03:53:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-13 03:53:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2018-04-13 03:53:28,465 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 29 [2018-04-13 03:53:28,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:28,465 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2018-04-13 03:53:28,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 03:53:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2018-04-13 03:53:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 03:53:28,465 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:28,465 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:28,465 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash -94362021, now seen corresponding path program 2 times [2018-04-13 03:53:28,466 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:28,466 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:28,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:28,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:28,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:28,471 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:28,473 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:28,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:28,473 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:28,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:53:28,485 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:53:28,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:28,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:28,508 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-13 03:53:28,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,513 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-13 03:53:28,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:28,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:28,534 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-13 03:53:28,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:28,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:28,544 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-13 03:53:28,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,548 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-13 03:53:28,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:28,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:28,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 03:53:28,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 03:53:28,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 03:53:28,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-04-13 03:53:28,601 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 11 states. [2018-04-13 03:53:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:28,753 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2018-04-13 03:53:28,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 03:53:28,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-04-13 03:53:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:28,754 INFO L225 Difference]: With dead ends: 152 [2018-04-13 03:53:28,754 INFO L226 Difference]: Without dead ends: 152 [2018-04-13 03:53:28,754 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-04-13 03:53:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-13 03:53:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2018-04-13 03:53:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-13 03:53:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2018-04-13 03:53:28,758 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 29 [2018-04-13 03:53:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:28,758 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2018-04-13 03:53:28,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 03:53:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2018-04-13 03:53:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 03:53:28,759 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:28,759 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:28,759 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:28,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1749994402, now seen corresponding path program 1 times [2018-04-13 03:53:28,759 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:28,759 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:28,760 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:28,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:28,760 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:28,766 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:28,767 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:28,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:28,767 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:28,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:28,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:28,819 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 27 [2018-04-13 03:53:28,822 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 23 treesize of output 15 [2018-04-13 03:53:28,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,830 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-13 03:53:28,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-13 03:53:28,853 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-13 03:53:28,859 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-13 03:53:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 03:53:28,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:28,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 03:53:28,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:53:28,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:53:28,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-13 03:53:28,864 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 8 states. [2018-04-13 03:53:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:28,934 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2018-04-13 03:53:28,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 03:53:28,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-13 03:53:28,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:28,935 INFO L225 Difference]: With dead ends: 128 [2018-04-13 03:53:28,935 INFO L226 Difference]: Without dead ends: 78 [2018-04-13 03:53:28,935 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 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-13 03:53:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-13 03:53:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-04-13 03:53:28,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-13 03:53:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-04-13 03:53:28,937 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 31 [2018-04-13 03:53:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:28,937 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-04-13 03:53:28,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:53:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-04-13 03:53:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 03:53:28,938 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:28,938 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:28,938 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:28,938 INFO L82 PathProgramCache]: Analyzing trace with hash -422117991, now seen corresponding path program 3 times [2018-04-13 03:53:28,938 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:28,938 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:28,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:28,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:28,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:28,947 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:28,953 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:28,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:28,953 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:28,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:53:28,982 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 03:53:28,982 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:28,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:28,991 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-13 03:53:28,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:28,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 03:53:29,010 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-13 03:53:29,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:29,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:29,019 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-13 03:53:29,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 03:53:29,043 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-13 03:53:29,045 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-13 03:53:29,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-13 03:53:29,093 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 23 treesize of output 24 [2018-04-13 03:53:29,095 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 8 treesize of output 7 [2018-04-13 03:53:29,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-13 03:53:29,137 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 23 treesize of output 24 [2018-04-13 03:53:29,140 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 8 treesize of output 7 [2018-04-13 03:53:29,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-04-13 03:53:29,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-13 03:53:29,174 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 17 treesize of output 14 [2018-04-13 03:53:29,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:29,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:29,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:29,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-13 03:53:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 03:53:29,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:29,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 03:53:29,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 03:53:29,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 03:53:29,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:53:29,226 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 16 states. [2018-04-13 03:53:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:29,587 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-04-13 03:53:29,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 03:53:29,588 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-04-13 03:53:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:29,588 INFO L225 Difference]: With dead ends: 63 [2018-04-13 03:53:29,588 INFO L226 Difference]: Without dead ends: 63 [2018-04-13 03:53:29,588 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:53:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-04-13 03:53:29,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-04-13 03:53:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-13 03:53:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-04-13 03:53:29,590 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 33 [2018-04-13 03:53:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:29,590 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-04-13 03:53:29,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 03:53:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-04-13 03:53:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 03:53:29,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:29,591 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:29,591 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:29,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1686720539, now seen corresponding path program 2 times [2018-04-13 03:53:29,591 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:29,591 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:29,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:29,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:29,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:29,599 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:29,604 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:29,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:29,604 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:29,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:53:29,622 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:53:29,622 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:29,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:29,633 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-13 03:53:29,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,638 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-13 03:53:29,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:53:29,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:29,673 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-13 03:53:29,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:29,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:29,683 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-13 03:53:29,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:29,688 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-13 03:53:29,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:53:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:29,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:29,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 03:53:29,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:53:29,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:53:29,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:53:29,854 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 17 states. [2018-04-13 03:53:30,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:30,185 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-04-13 03:53:30,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 03:53:30,185 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-04-13 03:53:30,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:30,186 INFO L225 Difference]: With dead ends: 79 [2018-04-13 03:53:30,186 INFO L226 Difference]: Without dead ends: 79 [2018-04-13 03:53:30,186 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:53:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-04-13 03:53:30,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2018-04-13 03:53:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-13 03:53:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-13 03:53:30,188 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 34 [2018-04-13 03:53:30,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:30,188 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-13 03:53:30,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:53:30,188 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-13 03:53:30,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 03:53:30,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:30,189 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:30,189 INFO L408 AbstractCegarLoop]: === Iteration 23 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:30,189 INFO L82 PathProgramCache]: Analyzing trace with hash -9638484, now seen corresponding path program 1 times [2018-04-13 03:53:30,189 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:30,189 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:30,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:30,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:30,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:30,197 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:30,201 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:30,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:30,201 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:30,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:30,221 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:30,228 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-13 03:53:30,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:30,233 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-13 03:53:30,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:30,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:30,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:30,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:30,252 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-13 03:53:30,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:30,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:30,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:30,262 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-13 03:53:30,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:30,267 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-13 03:53:30,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:30,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:30,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 03:53:30,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 03:53:30,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 03:53:30,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:53:30,427 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 16 states. [2018-04-13 03:53:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:30,772 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-04-13 03:53:30,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 03:53:30,772 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-04-13 03:53:30,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:30,773 INFO L225 Difference]: With dead ends: 90 [2018-04-13 03:53:30,773 INFO L226 Difference]: Without dead ends: 90 [2018-04-13 03:53:30,773 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:53:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-13 03:53:30,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 68. [2018-04-13 03:53:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-13 03:53:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-13 03:53:30,775 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 34 [2018-04-13 03:53:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:30,775 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-13 03:53:30,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 03:53:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-13 03:53:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 03:53:30,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:30,775 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:30,775 INFO L408 AbstractCegarLoop]: === Iteration 24 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash -218645245, now seen corresponding path program 2 times [2018-04-13 03:53:30,775 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:30,775 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:30,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:30,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:30,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:30,783 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:30,787 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:30,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:30,787 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:30,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:53:30,804 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:53:30,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:30,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:30,811 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-13 03:53:30,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:30,815 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-13 03:53:30,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:30,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:30,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:30,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:30,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:30,834 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-13 03:53:30,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:30,840 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-13 03:53:30,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:30,844 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-13 03:53:30,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:30,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:30,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 03:53:30,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 03:53:30,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 03:53:30,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:53:30,937 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 14 states. [2018-04-13 03:53:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:31,185 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-04-13 03:53:31,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 03:53:31,186 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-04-13 03:53:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:31,186 INFO L225 Difference]: With dead ends: 103 [2018-04-13 03:53:31,186 INFO L226 Difference]: Without dead ends: 103 [2018-04-13 03:53:31,186 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:53:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-13 03:53:31,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2018-04-13 03:53:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-13 03:53:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-04-13 03:53:31,188 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 34 [2018-04-13 03:53:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:31,188 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-04-13 03:53:31,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 03:53:31,188 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-04-13 03:53:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 03:53:31,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:31,189 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:31,189 INFO L408 AbstractCegarLoop]: === Iteration 25 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:31,189 INFO L82 PathProgramCache]: Analyzing trace with hash -200755875, now seen corresponding path program 3 times [2018-04-13 03:53:31,189 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:31,189 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:31,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:31,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:31,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:31,195 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:31,197 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:31,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:31,198 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:31,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:53:31,222 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 03:53:31,222 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:31,225 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:31,235 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-13 03:53:31,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 03:53:31,251 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 03:53:31,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:31,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:31,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:23 [2018-04-13 03:53:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:31,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:31,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 03:53:31,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 03:53:31,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 03:53:31,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:53:31,428 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 14 states. [2018-04-13 03:53:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:31,855 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-04-13 03:53:31,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:53:31,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-04-13 03:53:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:31,856 INFO L225 Difference]: With dead ends: 105 [2018-04-13 03:53:31,856 INFO L226 Difference]: Without dead ends: 105 [2018-04-13 03:53:31,857 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:53:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-13 03:53:31,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2018-04-13 03:53:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-13 03:53:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-04-13 03:53:31,859 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 34 [2018-04-13 03:53:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:31,859 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-04-13 03:53:31,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 03:53:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-04-13 03:53:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 03:53:31,859 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:31,859 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:31,860 INFO L408 AbstractCegarLoop]: === Iteration 26 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:31,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1138686536, now seen corresponding path program 3 times [2018-04-13 03:53:31,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:31,860 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:31,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:31,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:31,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:31,867 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:31,871 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:31,871 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:31,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:31,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:53:31,891 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 03:53:31,892 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:31,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:31,900 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-13 03:53:31,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,905 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-13 03:53:31,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:31,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:31,925 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-13 03:53:31,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:31,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:31,936 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-13 03:53:31,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,941 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-13 03:53:31,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:32,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:32,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:53:32,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:53:32,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:53:32,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:53:32,114 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 19 states. [2018-04-13 03:53:32,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:32,522 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2018-04-13 03:53:32,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 03:53:32,522 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-04-13 03:53:32,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:32,522 INFO L225 Difference]: With dead ends: 94 [2018-04-13 03:53:32,522 INFO L226 Difference]: Without dead ends: 94 [2018-04-13 03:53:32,523 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 03:53:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-13 03:53:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2018-04-13 03:53:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-13 03:53:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-04-13 03:53:32,525 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-04-13 03:53:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:32,525 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-04-13 03:53:32,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:53:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-04-13 03:53:32,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 03:53:32,526 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:32,526 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:32,526 INFO L408 AbstractCegarLoop]: === Iteration 27 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:32,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1423655137, now seen corresponding path program 2 times [2018-04-13 03:53:32,526 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:32,526 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:32,527 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:32,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:32,527 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:32,535 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:32,539 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:32,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:32,539 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:32,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:53:32,563 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:53:32,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:32,567 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:32,569 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-13 03:53:32,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:32,574 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-13 03:53:32,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:32,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:32,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:32,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:32,592 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-13 03:53:32,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:32,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:32,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:32,601 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-13 03:53:32,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:32,604 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-13 03:53:32,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:32,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:32,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 03:53:32,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:53:32,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:53:32,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:53:32,730 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 17 states. [2018-04-13 03:53:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:33,116 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-04-13 03:53:33,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 03:53:33,116 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-04-13 03:53:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:33,117 INFO L225 Difference]: With dead ends: 109 [2018-04-13 03:53:33,117 INFO L226 Difference]: Without dead ends: 109 [2018-04-13 03:53:33,117 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2018-04-13 03:53:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-13 03:53:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 78. [2018-04-13 03:53:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-13 03:53:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-04-13 03:53:33,118 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-04-13 03:53:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:33,118 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-04-13 03:53:33,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:53:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-04-13 03:53:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 03:53:33,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:33,119 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-13 03:53:33,119 INFO L408 AbstractCegarLoop]: === Iteration 28 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash -684757014, now seen corresponding path program 3 times [2018-04-13 03:53:33,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:33,119 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:33,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:33,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:33,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:33,124 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:33,126 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:33,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:33,126 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:33,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:53:33,141 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-13 03:53:33,141 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:33,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:33,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:33,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:33,149 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-13 03:53:33,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:33,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:33,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:33,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:33,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:33,166 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-13 03:53:33,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:33,173 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-13 03:53:33,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:33,177 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-13 03:53:33,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:33,361 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-13 03:53:33,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:33,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 03:53:33,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 03:53:33,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 03:53:33,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:53:33,362 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 16 states. [2018-04-13 03:53:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:33,819 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-04-13 03:53:33,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 03:53:33,819 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-04-13 03:53:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:33,820 INFO L225 Difference]: With dead ends: 120 [2018-04-13 03:53:33,820 INFO L226 Difference]: Without dead ends: 120 [2018-04-13 03:53:33,820 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:53:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-13 03:53:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 78. [2018-04-13 03:53:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-13 03:53:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-04-13 03:53:33,822 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-04-13 03:53:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:33,822 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-04-13 03:53:33,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 03:53:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-04-13 03:53:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 03:53:33,823 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:33,823 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:33,823 INFO L408 AbstractCegarLoop]: === Iteration 29 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:33,823 INFO L82 PathProgramCache]: Analyzing trace with hash -893763775, now seen corresponding path program 3 times [2018-04-13 03:53:33,823 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:33,823 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:33,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:33,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:33,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:33,831 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:33,836 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:33,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:33,836 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:33,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:53:33,862 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 03:53:33,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:33,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:33,873 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-13 03:53:33,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:33,882 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-13 03:53:33,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:33,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:33,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:33,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:33,902 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-13 03:53:33,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:33,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:33,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:33,912 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 03:53:33,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:33,917 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-13 03:53:33,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:34,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:34,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 03:53:34,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 03:53:34,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 03:53:34,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-04-13 03:53:34,014 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 15 states. [2018-04-13 03:53:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:34,456 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2018-04-13 03:53:34,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 03:53:34,456 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-04-13 03:53:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:34,457 INFO L225 Difference]: With dead ends: 133 [2018-04-13 03:53:34,457 INFO L226 Difference]: Without dead ends: 133 [2018-04-13 03:53:34,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:53:34,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-13 03:53:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 79. [2018-04-13 03:53:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-13 03:53:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-04-13 03:53:34,460 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 39 [2018-04-13 03:53:34,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:34,460 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-04-13 03:53:34,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 03:53:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-04-13 03:53:34,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 03:53:34,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:34,461 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:34,461 INFO L408 AbstractCegarLoop]: === Iteration 30 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:34,461 INFO L82 PathProgramCache]: Analyzing trace with hash -875874405, now seen corresponding path program 4 times [2018-04-13 03:53:34,461 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:34,461 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:34,462 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:34,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:34,462 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:34,469 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:34,473 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:34,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:34,473 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:34,474 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:53:34,498 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:53:34,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:34,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:34,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:34,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:34,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:34,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:34,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:34,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:34,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:34,530 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-13 03:53:34,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:34,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:34,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:34,540 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-13 03:53:34,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:34,546 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-13 03:53:34,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:34,643 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:34,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:34,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 03:53:34,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 03:53:34,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 03:53:34,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-13 03:53:34,707 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 13 states. [2018-04-13 03:53:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:34,955 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-04-13 03:53:34,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 03:53:34,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-04-13 03:53:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:34,956 INFO L225 Difference]: With dead ends: 135 [2018-04-13 03:53:34,956 INFO L226 Difference]: Without dead ends: 135 [2018-04-13 03:53:34,956 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:53:34,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-13 03:53:34,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2018-04-13 03:53:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-13 03:53:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-04-13 03:53:34,959 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 39 [2018-04-13 03:53:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:34,959 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-04-13 03:53:34,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 03:53:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-04-13 03:53:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 03:53:34,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:34,960 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:34,960 INFO L408 AbstractCegarLoop]: === Iteration 31 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:34,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1945848379, now seen corresponding path program 4 times [2018-04-13 03:53:34,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:34,960 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:34,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:34,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:34,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:34,967 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:34,971 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:34,971 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:34,971 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:34,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:53:34,987 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:53:34,987 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:34,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:35,015 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-13 03:53:35,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:35,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:35,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 03:53:35,040 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 03:53:35,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:35,052 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 2 xjuncts. [2018-04-13 03:53:35,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-04-13 03:53:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:35,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:35,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 03:53:35,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 03:53:35,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 03:53:35,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:53:35,625 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 26 states. [2018-04-13 03:53:37,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:37,319 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-04-13 03:53:37,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 03:53:37,319 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-04-13 03:53:37,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:37,320 INFO L225 Difference]: With dead ends: 114 [2018-04-13 03:53:37,320 INFO L226 Difference]: Without dead ends: 114 [2018-04-13 03:53:37,321 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=194, Invalid=2158, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 03:53:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-13 03:53:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2018-04-13 03:53:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-13 03:53:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-13 03:53:37,323 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 44 [2018-04-13 03:53:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:37,323 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-13 03:53:37,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 03:53:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-13 03:53:37,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 03:53:37,324 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:37,324 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:37,324 INFO L408 AbstractCegarLoop]: === Iteration 32 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:37,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1319759619, now seen corresponding path program 1 times [2018-04-13 03:53:37,324 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:37,324 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:37,325 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:37,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:37,325 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:37,332 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:37,337 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:37,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:37,337 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:37,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:37,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:37,369 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-13 03:53:37,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:37,374 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-13 03:53:37,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:37,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:37,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:37,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:37,393 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-13 03:53:37,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:37,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:37,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:37,403 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-13 03:53:37,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:37,408 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-13 03:53:37,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:37,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:37,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 03:53:37,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:53:37,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:53:37,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:53:37,634 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 21 states. [2018-04-13 03:53:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:38,055 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2018-04-13 03:53:38,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 03:53:38,055 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-04-13 03:53:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:38,055 INFO L225 Difference]: With dead ends: 133 [2018-04-13 03:53:38,055 INFO L226 Difference]: Without dead ends: 133 [2018-04-13 03:53:38,056 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=1263, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:53:38,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-13 03:53:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2018-04-13 03:53:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-13 03:53:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-13 03:53:38,058 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 44 [2018-04-13 03:53:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:38,058 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-13 03:53:38,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:53:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-13 03:53:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 03:53:38,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:38,059 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:38,059 INFO L408 AbstractCegarLoop]: === Iteration 33 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:38,059 INFO L82 PathProgramCache]: Analyzing trace with hash 819570380, now seen corresponding path program 4 times [2018-04-13 03:53:38,059 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:38,059 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:38,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:38,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:38,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:38,065 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:38,068 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:38,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:38,069 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:38,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:53:38,079 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:53:38,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:38,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:38,083 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-13 03:53:38,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:38,088 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-13 03:53:38,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:38,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:38,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:38,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:38,102 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-13 03:53:38,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:38,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:38,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:38,110 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-13 03:53:38,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:38,116 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-13 03:53:38,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:38,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:38,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:53:38,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:53:38,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:53:38,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:53:38,310 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 19 states. [2018-04-13 03:53:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:38,804 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-04-13 03:53:38,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 03:53:38,804 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-04-13 03:53:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:38,804 INFO L225 Difference]: With dead ends: 129 [2018-04-13 03:53:38,804 INFO L226 Difference]: Without dead ends: 129 [2018-04-13 03:53:38,805 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:53:38,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-13 03:53:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 88. [2018-04-13 03:53:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-13 03:53:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-13 03:53:38,806 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 44 [2018-04-13 03:53:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:38,806 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-13 03:53:38,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:53:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-13 03:53:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 03:53:38,806 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:38,806 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:38,807 INFO L408 AbstractCegarLoop]: === Iteration 34 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:38,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1176925539, now seen corresponding path program 5 times [2018-04-13 03:53:38,807 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:38,807 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:38,807 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:38,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:38,807 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:38,812 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:38,815 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:38,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:38,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:38,815 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:53:38,839 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-04-13 03:53:38,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:38,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:38,859 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-13 03:53:38,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:38,863 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-13 03:53:38,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:38,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:38,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:38,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:38,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:38,888 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-13 03:53:38,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:38,897 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-13 03:53:38,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:38,904 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-13 03:53:38,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:53:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:39,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:39,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 03:53:39,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:53:39,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:53:39,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:53:39,100 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 21 states. [2018-04-13 03:53:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:39,641 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2018-04-13 03:53:39,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:53:39,641 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-04-13 03:53:39,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:39,642 INFO L225 Difference]: With dead ends: 144 [2018-04-13 03:53:39,642 INFO L226 Difference]: Without dead ends: 144 [2018-04-13 03:53:39,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1338, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:53:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-13 03:53:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 88. [2018-04-13 03:53:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-13 03:53:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-13 03:53:39,644 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 44 [2018-04-13 03:53:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:39,644 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-13 03:53:39,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:53:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-13 03:53:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 03:53:39,645 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:39,645 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:39,645 INFO L408 AbstractCegarLoop]: === Iteration 35 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:39,645 INFO L82 PathProgramCache]: Analyzing trace with hash -931486612, now seen corresponding path program 6 times [2018-04-13 03:53:39,645 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:39,645 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:39,646 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:39,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:39,646 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:39,653 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:39,657 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:39,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:39,658 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:39,658 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:53:39,684 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-13 03:53:39,684 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:39,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:39,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:39,701 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 5 [2018-04-13 03:53:39,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:39,707 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-13 03:53:39,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:39,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:39,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-13 03:53:39,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:39,726 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-13 03:53:39,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:39,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:39,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:39,736 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-13 03:53:39,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:39,742 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-13 03:53:39,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:39,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-13 03:53:39,814 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 5 treesize of output 1 [2018-04-13 03:53:39,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:39,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:39,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:39,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:16 [2018-04-13 03:53:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:39,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:39,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 03:53:39,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:53:39,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:53:39,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:53:39,940 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 17 states. [2018-04-13 03:53:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:40,322 INFO L93 Difference]: Finished difference Result 155 states and 161 transitions. [2018-04-13 03:53:40,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 03:53:40,322 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-04-13 03:53:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:40,323 INFO L225 Difference]: With dead ends: 155 [2018-04-13 03:53:40,323 INFO L226 Difference]: Without dead ends: 155 [2018-04-13 03:53:40,323 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2018-04-13 03:53:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-13 03:53:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 88. [2018-04-13 03:53:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-13 03:53:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-13 03:53:40,324 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 44 [2018-04-13 03:53:40,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:40,325 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-13 03:53:40,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:53:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-13 03:53:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 03:53:40,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:40,325 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:40,325 INFO L408 AbstractCegarLoop]: === Iteration 36 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:40,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1140493373, now seen corresponding path program 4 times [2018-04-13 03:53:40,325 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:40,325 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:40,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:40,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:40,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:40,331 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:40,334 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:40,334 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:40,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:40,334 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:53:40,347 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:53:40,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:40,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:40,364 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-13 03:53:40,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:40,369 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-13 03:53:40,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:40,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:40,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:40,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:40,387 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-13 03:53:40,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:40,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:40,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:40,397 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-13 03:53:40,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:40,401 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-13 03:53:40,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:40,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:40,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 03:53:40,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 03:53:40,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 03:53:40,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:53:40,498 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 16 states. [2018-04-13 03:53:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:40,837 INFO L93 Difference]: Finished difference Result 168 states and 175 transitions. [2018-04-13 03:53:40,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 03:53:40,837 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-04-13 03:53:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:40,838 INFO L225 Difference]: With dead ends: 168 [2018-04-13 03:53:40,838 INFO L226 Difference]: Without dead ends: 168 [2018-04-13 03:53:40,838 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:53:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-13 03:53:40,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 89. [2018-04-13 03:53:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-13 03:53:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-04-13 03:53:40,839 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 44 [2018-04-13 03:53:40,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:40,840 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-04-13 03:53:40,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 03:53:40,840 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-04-13 03:53:40,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 03:53:40,840 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:40,840 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:40,840 INFO L408 AbstractCegarLoop]: === Iteration 37 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:40,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1122604003, now seen corresponding path program 5 times [2018-04-13 03:53:40,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:40,840 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:40,841 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:40,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:40,841 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:40,846 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:40,848 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:40,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:40,848 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:40,848 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:53:40,875 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 03:53:40,875 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:40,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:40,892 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-13 03:53:40,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:40,897 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-13 03:53:40,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:40,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:40,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:40,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:40,915 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-13 03:53:40,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:40,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:40,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:40,926 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-13 03:53:40,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:40,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:40,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-13 03:53:41,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 03:53:41,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-04-13 03:53:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:41,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:41,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 03:53:41,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 03:53:41,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 03:53:41,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:53:41,098 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 16 states. [2018-04-13 03:53:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:41,476 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-04-13 03:53:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 03:53:41,477 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-04-13 03:53:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:41,477 INFO L225 Difference]: With dead ends: 170 [2018-04-13 03:53:41,477 INFO L226 Difference]: Without dead ends: 170 [2018-04-13 03:53:41,478 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:53:41,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-13 03:53:41,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 93. [2018-04-13 03:53:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-13 03:53:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-04-13 03:53:41,480 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 44 [2018-04-13 03:53:41,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:41,480 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-04-13 03:53:41,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 03:53:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-04-13 03:53:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 03:53:41,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:41,481 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:41,481 INFO L408 AbstractCegarLoop]: === Iteration 38 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:41,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2104909720, now seen corresponding path program 5 times [2018-04-13 03:53:41,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:41,481 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:41,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:41,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:41,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:41,489 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:41,494 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:41,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:41,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:41,495 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:53:41,518 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 03:53:41,518 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:41,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:41,532 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-13 03:53:41,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,538 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-13 03:53:41,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:41,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:41,574 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-13 03:53:41,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:41,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:41,584 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-13 03:53:41,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,590 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-13 03:53:41,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:41,665 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 5 treesize of output 1 [2018-04-13 03:53:41,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-04-13 03:53:41,836 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:41,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:41,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 03:53:41,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 03:53:41,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 03:53:41,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:53:41,838 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 23 states. [2018-04-13 03:53:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:42,322 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-04-13 03:53:42,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 03:53:42,322 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-04-13 03:53:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:42,322 INFO L225 Difference]: With dead ends: 124 [2018-04-13 03:53:42,323 INFO L226 Difference]: Without dead ends: 124 [2018-04-13 03:53:42,323 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1563, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 03:53:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-13 03:53:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 98. [2018-04-13 03:53:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-13 03:53:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-04-13 03:53:42,324 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 49 [2018-04-13 03:53:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:42,325 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-04-13 03:53:42,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 03:53:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-04-13 03:53:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 03:53:42,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:42,325 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:42,325 INFO L408 AbstractCegarLoop]: === Iteration 39 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:42,325 INFO L82 PathProgramCache]: Analyzing trace with hash 236272577, now seen corresponding path program 7 times [2018-04-13 03:53:42,325 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:42,325 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:42,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:42,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:42,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:42,331 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:42,334 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:42,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:42,335 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:42,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:42,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:42,351 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-13 03:53:42,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:42,363 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-13 03:53:42,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:42,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:42,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:42,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:42,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:42,378 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-13 03:53:42,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:42,404 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-13 03:53:42,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:42,409 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-13 03:53:42,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:42,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:42,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 03:53:42,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 03:53:42,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 03:53:42,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:53:42,677 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 22 states. [2018-04-13 03:53:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:43,270 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2018-04-13 03:53:43,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 03:53:43,270 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-04-13 03:53:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:43,271 INFO L225 Difference]: With dead ends: 149 [2018-04-13 03:53:43,271 INFO L226 Difference]: Without dead ends: 149 [2018-04-13 03:53:43,271 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=1489, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:53:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-13 03:53:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2018-04-13 03:53:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-13 03:53:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-04-13 03:53:43,272 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 49 [2018-04-13 03:53:43,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:43,272 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-04-13 03:53:43,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 03:53:43,273 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-04-13 03:53:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 03:53:43,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:43,273 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:43,273 INFO L408 AbstractCegarLoop]: === Iteration 40 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:43,273 INFO L82 PathProgramCache]: Analyzing trace with hash -263916662, now seen corresponding path program 8 times [2018-04-13 03:53:43,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:43,273 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:43,273 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:43,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:43,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:43,278 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:43,280 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:43,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:43,280 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:43,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:53:43,291 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:53:43,291 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:43,293 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:43,304 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-13 03:53:43,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:43,308 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-13 03:53:43,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:43,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:43,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:43,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:43,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:43,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 03:53:43,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:43,328 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-13 03:53:43,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:43,337 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-13 03:53:43,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:43,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:43,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 03:53:43,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 03:53:43,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 03:53:43,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:53:43,659 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 20 states. [2018-04-13 03:53:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:44,324 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2018-04-13 03:53:44,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 03:53:44,325 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-04-13 03:53:44,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:44,325 INFO L225 Difference]: With dead ends: 169 [2018-04-13 03:53:44,325 INFO L226 Difference]: Without dead ends: 169 [2018-04-13 03:53:44,326 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:53:44,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-13 03:53:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 98. [2018-04-13 03:53:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-13 03:53:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-04-13 03:53:44,327 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 49 [2018-04-13 03:53:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:44,327 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-04-13 03:53:44,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 03:53:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-04-13 03:53:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 03:53:44,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:44,328 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:44,328 INFO L408 AbstractCegarLoop]: === Iteration 41 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:44,328 INFO L82 PathProgramCache]: Analyzing trace with hash 93438497, now seen corresponding path program 9 times [2018-04-13 03:53:44,328 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:44,328 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:44,329 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:44,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:44,329 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:44,335 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:44,341 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:44,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:44,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:44,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:53:44,398 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 03:53:44,398 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:44,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:44,406 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-13 03:53:44,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,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 6 treesize of output 5 [2018-04-13 03:53:44,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:44,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:44,440 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-13 03:53:44,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:44,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:44,448 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-13 03:53:44,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,452 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-13 03:53:44,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:44,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-13 03:53:44,508 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 5 treesize of output 1 [2018-04-13 03:53:44,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:16 [2018-04-13 03:53:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:44,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:44,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:53:44,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:53:44,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:53:44,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:53:44,732 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 19 states. [2018-04-13 03:53:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:45,203 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2018-04-13 03:53:45,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 03:53:45,204 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-04-13 03:53:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:45,204 INFO L225 Difference]: With dead ends: 184 [2018-04-13 03:53:45,204 INFO L226 Difference]: Without dead ends: 184 [2018-04-13 03:53:45,204 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:53:45,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-13 03:53:45,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 98. [2018-04-13 03:53:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-13 03:53:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-04-13 03:53:45,206 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 49 [2018-04-13 03:53:45,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:45,206 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-04-13 03:53:45,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:53:45,206 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-04-13 03:53:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 03:53:45,206 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:45,206 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:45,207 INFO L408 AbstractCegarLoop]: === Iteration 42 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:45,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2014973654, now seen corresponding path program 10 times [2018-04-13 03:53:45,207 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:45,207 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:45,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:45,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:45,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:45,213 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:45,215 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:45,215 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:45,215 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:45,216 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:53:45,239 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:53:45,239 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:45,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:45,252 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-13 03:53:45,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:45,258 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-13 03:53:45,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:45,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:45,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:45,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:45,277 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-13 03:53:45,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:45,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:45,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:45,287 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-13 03:53:45,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:45,292 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-13 03:53:45,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:45,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:45,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 03:53:45,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 03:53:45,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 03:53:45,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-04-13 03:53:45,483 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 18 states. [2018-04-13 03:53:45,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:45,940 INFO L93 Difference]: Finished difference Result 195 states and 202 transitions. [2018-04-13 03:53:45,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 03:53:45,940 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-04-13 03:53:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:45,941 INFO L225 Difference]: With dead ends: 195 [2018-04-13 03:53:45,941 INFO L226 Difference]: Without dead ends: 195 [2018-04-13 03:53:45,941 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:53:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-13 03:53:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 98. [2018-04-13 03:53:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-13 03:53:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-04-13 03:53:45,943 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 49 [2018-04-13 03:53:45,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:45,943 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-04-13 03:53:45,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 03:53:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-04-13 03:53:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 03:53:45,944 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:45,944 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:45,944 INFO L408 AbstractCegarLoop]: === Iteration 43 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:45,944 INFO L82 PathProgramCache]: Analyzing trace with hash 2070986881, now seen corresponding path program 5 times [2018-04-13 03:53:45,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:45,944 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:45,945 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:45,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:45,945 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:45,953 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:45,958 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:45,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:45,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:45,959 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:53:45,987 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 03:53:45,987 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:45,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:46,023 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-13 03:53:46,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:46,027 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-13 03:53:46,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:46,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:46,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:46,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:46,040 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-13 03:53:46,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:46,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:46,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:46,049 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-13 03:53:46,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:46,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:46,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2018-04-13 03:53:46,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 03:53:46,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:46,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:46,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:17 [2018-04-13 03:53:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:46,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:46,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 03:53:46,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 03:53:46,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 03:53:46,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:53:46,250 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 20 states. [2018-04-13 03:53:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:46,901 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-04-13 03:53:46,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:53:46,901 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-04-13 03:53:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:46,902 INFO L225 Difference]: With dead ends: 208 [2018-04-13 03:53:46,902 INFO L226 Difference]: Without dead ends: 208 [2018-04-13 03:53:46,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=1274, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:53:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-13 03:53:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 99. [2018-04-13 03:53:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-13 03:53:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-04-13 03:53:46,903 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 49 [2018-04-13 03:53:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:46,904 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-04-13 03:53:46,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 03:53:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-04-13 03:53:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 03:53:46,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:46,904 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:46,904 INFO L408 AbstractCegarLoop]: === Iteration 44 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:46,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2088876251, now seen corresponding path program 6 times [2018-04-13 03:53:46,904 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:46,904 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:46,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:46,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:46,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:46,909 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:46,912 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:46,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:46,912 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:46,913 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:53:46,953 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-13 03:53:46,953 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:46,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:46,972 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-13 03:53:46,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:46,976 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-13 03:53:46,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:46,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:46,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:46,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:46,990 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-13 03:53:46,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:46,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:46,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:46,999 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-13 03:53:46,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:47,004 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-13 03:53:47,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:53:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:47,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:47,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 03:53:47,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 03:53:47,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 03:53:47,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:53:47,110 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 16 states. [2018-04-13 03:53:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:47,463 INFO L93 Difference]: Finished difference Result 210 states and 219 transitions. [2018-04-13 03:53:47,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 03:53:47,463 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-04-13 03:53:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:47,464 INFO L225 Difference]: With dead ends: 210 [2018-04-13 03:53:47,464 INFO L226 Difference]: Without dead ends: 210 [2018-04-13 03:53:47,464 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:53:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-13 03:53:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 103. [2018-04-13 03:53:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-13 03:53:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-04-13 03:53:47,465 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 49 [2018-04-13 03:53:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:47,466 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-04-13 03:53:47,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 03:53:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-04-13 03:53:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 03:53:47,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:47,466 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:47,466 INFO L408 AbstractCegarLoop]: === Iteration 45 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:47,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1655497637, now seen corresponding path program 6 times [2018-04-13 03:53:47,466 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:47,466 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:47,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:47,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:47,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:47,471 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:47,474 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:47,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:47,474 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:47,475 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:53:47,492 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-13 03:53:47,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:47,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:47,513 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-13 03:53:47,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:47,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:47,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 03:53:47,531 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 03:53:47,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:47,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 03:53:47,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:24 [2018-04-13 03:53:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:47,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:47,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 03:53:47,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 03:53:47,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 03:53:47,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:53:47,916 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 25 states. [2018-04-13 03:53:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:49,297 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-04-13 03:53:49,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 03:53:49,298 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-04-13 03:53:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:49,298 INFO L225 Difference]: With dead ends: 144 [2018-04-13 03:53:49,298 INFO L226 Difference]: Without dead ends: 144 [2018-04-13 03:53:49,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=171, Invalid=1899, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 03:53:49,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-13 03:53:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 108. [2018-04-13 03:53:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-13 03:53:49,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-13 03:53:49,300 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-13 03:53:49,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:49,300 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-13 03:53:49,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 03:53:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-13 03:53:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 03:53:49,300 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:49,300 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:49,301 INFO L408 AbstractCegarLoop]: === Iteration 46 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:49,301 INFO L82 PathProgramCache]: Analyzing trace with hash -700307613, now seen corresponding path program 2 times [2018-04-13 03:53:49,301 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:49,301 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:49,301 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:49,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:49,301 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:49,306 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:49,309 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:49,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:49,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:49,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:53:49,320 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:53:49,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:49,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:49,333 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-13 03:53:49,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:49,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:49,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:49,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:49,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:53:49,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:49,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:49,355 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-13 03:53:49,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:49,360 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-13 03:53:49,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:49,364 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-13 03:53:49,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:53:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:49,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:49,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 03:53:49,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 03:53:49,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 03:53:49,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:53:49,708 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 25 states. [2018-04-13 03:53:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:50,572 INFO L93 Difference]: Finished difference Result 173 states and 181 transitions. [2018-04-13 03:53:50,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 03:53:50,573 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-04-13 03:53:50,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:50,573 INFO L225 Difference]: With dead ends: 173 [2018-04-13 03:53:50,573 INFO L226 Difference]: Without dead ends: 173 [2018-04-13 03:53:50,574 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=1810, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 03:53:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-13 03:53:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 108. [2018-04-13 03:53:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-13 03:53:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-13 03:53:50,575 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-13 03:53:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:50,575 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-13 03:53:50,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 03:53:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-13 03:53:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 03:53:50,575 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:50,575 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:50,576 INFO L408 AbstractCegarLoop]: === Iteration 47 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:50,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1829337068, now seen corresponding path program 11 times [2018-04-13 03:53:50,576 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:50,576 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:50,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:50,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:50,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:50,581 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:50,585 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:50,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:50,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:50,586 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:53:50,608 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 03:53:50,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:50,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:50,615 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-13 03:53:50,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:50,620 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-13 03:53:50,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:50,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:50,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:50,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:50,639 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-13 03:53:50,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:50,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:50,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:50,653 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-13 03:53:50,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:50,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:53:50,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:53:50,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:53:50,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:50,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:50,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 03:53:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:50,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:50,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 03:53:50,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 03:53:50,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 03:53:50,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:53:50,967 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 25 states. [2018-04-13 03:53:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:51,876 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2018-04-13 03:53:51,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 03:53:51,876 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-04-13 03:53:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:51,876 INFO L225 Difference]: With dead ends: 169 [2018-04-13 03:53:51,876 INFO L226 Difference]: Without dead ends: 169 [2018-04-13 03:53:51,877 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=1983, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 03:53:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-13 03:53:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 108. [2018-04-13 03:53:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-13 03:53:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-13 03:53:51,879 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-13 03:53:51,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:51,879 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-13 03:53:51,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 03:53:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-13 03:53:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 03:53:51,880 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:51,880 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:51,880 INFO L408 AbstractCegarLoop]: === Iteration 48 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:51,880 INFO L82 PathProgramCache]: Analyzing trace with hash 772945347, now seen corresponding path program 12 times [2018-04-13 03:53:51,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:51,880 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:51,881 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:51,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:51,881 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:51,888 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:51,893 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:51,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:51,893 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:51,893 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:53:51,913 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-04-13 03:53:51,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:51,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:51,923 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-13 03:53:51,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:51,927 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-13 03:53:51,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:51,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:51,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:51,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:51,941 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-13 03:53:51,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:51,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:51,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:51,948 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-13 03:53:51,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:51,951 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-13 03:53:51,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:52,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:52,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 03:53:52,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 03:53:52,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 03:53:52,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:53:52,179 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 23 states. [2018-04-13 03:53:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:52,818 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2018-04-13 03:53:52,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 03:53:52,818 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-04-13 03:53:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:52,819 INFO L225 Difference]: With dead ends: 194 [2018-04-13 03:53:52,819 INFO L226 Difference]: Without dead ends: 194 [2018-04-13 03:53:52,819 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=1645, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 03:53:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-13 03:53:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 108. [2018-04-13 03:53:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-13 03:53:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-13 03:53:52,822 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-13 03:53:52,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:52,822 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-13 03:53:52,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 03:53:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-13 03:53:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 03:53:52,823 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:52,823 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:52,823 INFO L408 AbstractCegarLoop]: === Iteration 49 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:52,823 INFO L82 PathProgramCache]: Analyzing trace with hash 272756108, now seen corresponding path program 13 times [2018-04-13 03:53:52,823 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:52,823 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:52,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:52,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:52,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:52,828 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:52,832 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:52,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:52,832 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:52,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:52,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:52,864 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-13 03:53:52,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:52,868 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-13 03:53:52,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:52,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:52,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:52,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:52,882 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-13 03:53:52,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:52,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:52,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:52,890 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-13 03:53:52,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:52,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-13 03:53:52,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:53,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:53,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 03:53:53,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:53:53,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:53:53,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:53:53,099 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 21 states. [2018-04-13 03:53:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:53,711 INFO L93 Difference]: Finished difference Result 214 states and 222 transitions. [2018-04-13 03:53:53,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 03:53:53,711 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-04-13 03:53:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:53,712 INFO L225 Difference]: With dead ends: 214 [2018-04-13 03:53:53,712 INFO L226 Difference]: Without dead ends: 214 [2018-04-13 03:53:53,712 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=1272, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:53:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-13 03:53:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 108. [2018-04-13 03:53:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-13 03:53:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-13 03:53:53,713 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-13 03:53:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:53,714 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-13 03:53:53,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:53:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-13 03:53:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 03:53:53,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:53,714 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:53,714 INFO L408 AbstractCegarLoop]: === Iteration 50 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:53,714 INFO L82 PathProgramCache]: Analyzing trace with hash 630111267, now seen corresponding path program 14 times [2018-04-13 03:53:53,714 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:53,714 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:53,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:53,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:53,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:53,719 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:53,722 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:53,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:53,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:53,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:53:53,745 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:53:53,745 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:53,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:53,754 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-13 03:53:53,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:53,759 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-13 03:53:53,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:53,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:53,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:53,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:53,777 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-13 03:53:53,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:53,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:53,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:53,790 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-13 03:53:53,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:53,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:53,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-13 03:53:53,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 03:53:53,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:53,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:53,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:19 [2018-04-13 03:53:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:54,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:54,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 03:53:54,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 03:53:54,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 03:53:54,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:53:54,128 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 22 states. [2018-04-13 03:53:54,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:54,888 INFO L93 Difference]: Finished difference Result 229 states and 237 transitions. [2018-04-13 03:53:54,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 03:53:54,888 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-04-13 03:53:54,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:54,889 INFO L225 Difference]: With dead ends: 229 [2018-04-13 03:53:54,889 INFO L226 Difference]: Without dead ends: 229 [2018-04-13 03:53:54,889 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=1495, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:53:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-13 03:53:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 108. [2018-04-13 03:53:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-13 03:53:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-13 03:53:54,891 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-13 03:53:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:54,891 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-13 03:53:54,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 03:53:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-13 03:53:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 03:53:54,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:54,891 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:54,891 INFO L408 AbstractCegarLoop]: === Iteration 51 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1478300884, now seen corresponding path program 15 times [2018-04-13 03:53:54,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:54,892 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:54,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:54,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:54,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:54,897 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:54,899 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:54,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:54,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:54,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:53:54,920 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-13 03:53:54,920 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:54,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:54,943 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-13 03:53:54,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:54,958 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-13 03:53:54,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:54,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:54,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:54,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:54,972 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-13 03:53:54,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:54,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:54,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:54,997 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-13 03:53:54,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:55,002 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-13 03:53:55,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:55,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:55,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:53:55,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:53:55,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:53:55,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:53:55,204 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 19 states. [2018-04-13 03:53:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:55,711 INFO L93 Difference]: Finished difference Result 240 states and 248 transitions. [2018-04-13 03:53:55,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 03:53:55,712 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-04-13 03:53:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:55,713 INFO L225 Difference]: With dead ends: 240 [2018-04-13 03:53:55,713 INFO L226 Difference]: Without dead ends: 240 [2018-04-13 03:53:55,713 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:53:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-13 03:53:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 108. [2018-04-13 03:53:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-13 03:53:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-13 03:53:55,715 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-13 03:53:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:55,715 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-13 03:53:55,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:53:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-13 03:53:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 03:53:55,716 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:55,716 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:55,716 INFO L408 AbstractCegarLoop]: === Iteration 52 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:55,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1687307645, now seen corresponding path program 6 times [2018-04-13 03:53:55,716 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:55,716 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:55,717 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:55,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:55,717 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:55,723 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:55,726 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:55,727 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:55,727 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:55,727 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:53:55,756 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-13 03:53:55,756 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:55,760 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:55,791 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-13 03:53:55,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:55,806 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-13 03:53:55,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:55,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:55,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:55,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:55,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:55,846 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-13 03:53:55,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:55,854 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-13 03:53:55,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:55,861 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-13 03:53:55,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:53:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:56,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:56,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:53:56,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:53:56,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:53:56,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:53:56,097 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 19 states. [2018-04-13 03:53:56,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:56,699 INFO L93 Difference]: Finished difference Result 253 states and 262 transitions. [2018-04-13 03:53:56,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 03:53:56,700 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-04-13 03:53:56,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:56,700 INFO L225 Difference]: With dead ends: 253 [2018-04-13 03:53:56,700 INFO L226 Difference]: Without dead ends: 253 [2018-04-13 03:53:56,700 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 03:53:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-13 03:53:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 109. [2018-04-13 03:53:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-13 03:53:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-04-13 03:53:56,702 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 54 [2018-04-13 03:53:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:56,703 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-04-13 03:53:56,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:53:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-04-13 03:53:56,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 03:53:56,703 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:56,703 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:56,703 INFO L408 AbstractCegarLoop]: === Iteration 53 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:56,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1669418275, now seen corresponding path program 7 times [2018-04-13 03:53:56,703 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:56,703 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:56,704 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:56,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:56,704 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:56,709 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:56,711 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:56,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:56,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:56,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:56,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:56,742 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-13 03:53:56,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:56,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:56,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:56,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:56,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:56,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:56,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:56,763 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-13 03:53:56,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:56,768 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-13 03:53:56,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:56,773 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-13 03:53:56,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:53:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:56,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:56,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 03:53:56,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 03:53:56,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 03:53:56,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:53:56,904 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 16 states. [2018-04-13 03:53:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:57,262 INFO L93 Difference]: Finished difference Result 255 states and 265 transitions. [2018-04-13 03:53:57,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 03:53:57,263 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-04-13 03:53:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:57,263 INFO L225 Difference]: With dead ends: 255 [2018-04-13 03:53:57,263 INFO L226 Difference]: Without dead ends: 255 [2018-04-13 03:53:57,263 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:53:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-13 03:53:57,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 113. [2018-04-13 03:53:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-13 03:53:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-04-13 03:53:57,265 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 54 [2018-04-13 03:53:57,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:57,265 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-04-13 03:53:57,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 03:53:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-04-13 03:53:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 03:53:57,266 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:57,266 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:57,266 INFO L408 AbstractCegarLoop]: === Iteration 54 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:53:57,266 INFO L82 PathProgramCache]: Analyzing trace with hash -583852408, now seen corresponding path program 7 times [2018-04-13 03:53:57,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:57,266 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:57,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:57,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:57,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:57,271 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:57,273 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:57,273 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:57,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:57,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:57,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:57,287 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-13 03:53:57,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:57,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:57,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 03:53:57,301 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 03:53:57,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:57,309 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 2 xjuncts. [2018-04-13 03:53:57,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-04-13 03:53:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:57,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:57,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 03:53:57,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 03:53:57,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 03:53:57,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:53:57,895 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 31 states. [2018-04-13 03:54:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:00,071 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-04-13 03:54:00,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:54:00,072 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-04-13 03:54:00,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:00,072 INFO L225 Difference]: With dead ends: 159 [2018-04-13 03:54:00,072 INFO L226 Difference]: Without dead ends: 159 [2018-04-13 03:54:00,073 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=231, Invalid=3191, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 03:54:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-13 03:54:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2018-04-13 03:54:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-13 03:54:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-13 03:54:00,074 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-13 03:54:00,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:00,074 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-13 03:54:00,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 03:54:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-13 03:54:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 03:54:00,074 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:00,074 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:00,074 INFO L408 AbstractCegarLoop]: === Iteration 55 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:00,074 INFO L82 PathProgramCache]: Analyzing trace with hash -139951734, now seen corresponding path program 3 times [2018-04-13 03:54:00,075 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:00,075 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:00,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:00,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:00,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:00,082 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:00,087 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:00,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:00,087 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:00,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:54:00,110 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-13 03:54:00,110 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:00,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:00,124 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-13 03:54:00,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:00,140 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-13 03:54:00,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:00,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:00,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:00,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:00,156 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-13 03:54:00,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:00,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:00,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:00,163 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-13 03:54:00,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:00,167 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-13 03:54:00,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:00,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:00,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 03:54:00,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 03:54:00,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 03:54:00,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:54:00,396 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 26 states. [2018-04-13 03:54:01,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:01,001 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-04-13 03:54:01,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 03:54:01,034 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-04-13 03:54:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:01,035 INFO L225 Difference]: With dead ends: 193 [2018-04-13 03:54:01,035 INFO L226 Difference]: Without dead ends: 193 [2018-04-13 03:54:01,035 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=2076, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 03:54:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-13 03:54:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 118. [2018-04-13 03:54:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-13 03:54:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-13 03:54:01,037 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-13 03:54:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:01,037 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-13 03:54:01,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 03:54:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-13 03:54:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 03:54:01,037 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:01,037 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:01,037 INFO L408 AbstractCegarLoop]: === Iteration 56 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:01,038 INFO L82 PathProgramCache]: Analyzing trace with hash -222617951, now seen corresponding path program 16 times [2018-04-13 03:54:01,038 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:01,038 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:01,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:01,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:01,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:01,043 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:01,048 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:01,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:01,048 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:01,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:54:01,072 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:54:01,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:01,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:01,082 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-13 03:54:01,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:01,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:54:01,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:01,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:01,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:01,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:01,151 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-13 03:54:01,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:01,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:01,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:01,171 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-13 03:54:01,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:01,175 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-13 03:54:01,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:01,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:01,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 03:54:01,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 03:54:01,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 03:54:01,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:54:01,703 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 27 states. [2018-04-13 03:54:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:02,547 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2018-04-13 03:54:02,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:54:02,547 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-04-13 03:54:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:02,547 INFO L225 Difference]: With dead ends: 189 [2018-04-13 03:54:02,548 INFO L226 Difference]: Without dead ends: 189 [2018-04-13 03:54:02,548 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=194, Invalid=2356, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 03:54:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-13 03:54:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 118. [2018-04-13 03:54:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-13 03:54:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-13 03:54:02,550 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-13 03:54:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:02,550 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-13 03:54:02,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 03:54:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-13 03:54:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 03:54:02,551 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:02,551 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:02,551 INFO L408 AbstractCegarLoop]: === Iteration 57 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:02,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1987940566, now seen corresponding path program 17 times [2018-04-13 03:54:02,551 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:02,551 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:02,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:02,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:02,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:02,558 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:02,563 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:02,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:02,564 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:02,564 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:54:02,592 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 03:54:02,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:02,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:02,611 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-13 03:54:02,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:02,617 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-13 03:54:02,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:02,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:02,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:02,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:02,636 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-13 03:54:02,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:02,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:02,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:02,645 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-13 03:54:02,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:02,649 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-13 03:54:02,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:02,763 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 5 treesize of output 1 [2018-04-13 03:54:02,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:02,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:02,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-04-13 03:54:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:02,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:02,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 03:54:02,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 03:54:02,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 03:54:02,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=648, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:54:02,919 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 27 states. [2018-04-13 03:54:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:03,735 INFO L93 Difference]: Finished difference Result 219 states and 228 transitions. [2018-04-13 03:54:03,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:54:03,735 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-04-13 03:54:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:03,736 INFO L225 Difference]: With dead ends: 219 [2018-04-13 03:54:03,736 INFO L226 Difference]: Without dead ends: 219 [2018-04-13 03:54:03,736 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=2357, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 03:54:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-13 03:54:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 118. [2018-04-13 03:54:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-13 03:54:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-13 03:54:03,738 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-13 03:54:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:03,738 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-13 03:54:03,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 03:54:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-13 03:54:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 03:54:03,738 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:03,738 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:03,739 INFO L408 AbstractCegarLoop]: === Iteration 58 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1250635009, now seen corresponding path program 18 times [2018-04-13 03:54:03,739 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:03,739 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:03,739 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:03,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:03,739 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:03,744 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:03,748 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:03,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:03,748 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:03,749 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:54:03,774 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-04-13 03:54:03,774 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:03,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:03,807 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-13 03:54:03,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:03,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:54:03,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:03,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:03,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:03,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:03,827 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-13 03:54:03,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:03,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:03,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:03,838 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-13 03:54:03,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:03,842 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-13 03:54:03,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:04,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:04,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 03:54:04,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 03:54:04,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 03:54:04,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:54:04,132 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 24 states. [2018-04-13 03:54:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:04,932 INFO L93 Difference]: Finished difference Result 244 states and 253 transitions. [2018-04-13 03:54:04,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 03:54:04,932 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-04-13 03:54:04,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:04,933 INFO L225 Difference]: With dead ends: 244 [2018-04-13 03:54:04,933 INFO L226 Difference]: Without dead ends: 244 [2018-04-13 03:54:04,933 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=1813, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 03:54:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-13 03:54:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 118. [2018-04-13 03:54:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-13 03:54:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-13 03:54:04,935 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-13 03:54:04,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:04,935 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-13 03:54:04,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 03:54:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-13 03:54:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 03:54:04,935 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:04,935 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:04,935 INFO L408 AbstractCegarLoop]: === Iteration 59 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:04,935 INFO L82 PathProgramCache]: Analyzing trace with hash 750445770, now seen corresponding path program 19 times [2018-04-13 03:54:04,936 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:04,936 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:04,936 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:04,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:04,936 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:04,941 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:04,944 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:04,944 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:04,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:04,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:04,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:04,980 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-13 03:54:04,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:04,985 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-13 03:54:04,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:04,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:04,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:05,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:05,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:05,003 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-13 03:54:05,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:05,010 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-13 03:54:05,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:05,015 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-13 03:54:05,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:05,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:05,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 03:54:05,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 03:54:05,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 03:54:05,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:54:05,295 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 22 states. [2018-04-13 03:54:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:05,984 INFO L93 Difference]: Finished difference Result 264 states and 273 transitions. [2018-04-13 03:54:05,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:54:05,984 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2018-04-13 03:54:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:05,984 INFO L225 Difference]: With dead ends: 264 [2018-04-13 03:54:05,984 INFO L226 Difference]: Without dead ends: 264 [2018-04-13 03:54:05,985 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=1420, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 03:54:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-04-13 03:54:05,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 118. [2018-04-13 03:54:05,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-13 03:54:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-13 03:54:05,986 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-13 03:54:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:05,986 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-13 03:54:05,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 03:54:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-13 03:54:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 03:54:05,986 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:05,986 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:05,986 INFO L408 AbstractCegarLoop]: === Iteration 60 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:05,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1107800929, now seen corresponding path program 20 times [2018-04-13 03:54:05,987 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:05,987 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:05,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:05,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:05,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:05,992 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:05,996 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:05,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:05,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:05,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:54:06,020 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:54:06,020 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:06,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:06,044 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-13 03:54:06,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:06,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-13 03:54:06,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:06,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:06,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:06,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:06,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:06,064 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-13 03:54:06,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:06,069 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-13 03:54:06,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:06,073 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-13 03:54:06,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:06,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:06,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 03:54:06,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:54:06,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:54:06,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:54:06,299 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 21 states. [2018-04-13 03:54:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:06,918 INFO L93 Difference]: Finished difference Result 279 states and 288 transitions. [2018-04-13 03:54:06,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 03:54:06,918 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2018-04-13 03:54:06,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:06,919 INFO L225 Difference]: With dead ends: 279 [2018-04-13 03:54:06,919 INFO L226 Difference]: Without dead ends: 279 [2018-04-13 03:54:06,919 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:54:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-13 03:54:06,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 118. [2018-04-13 03:54:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-13 03:54:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-13 03:54:06,921 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-13 03:54:06,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:06,921 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-13 03:54:06,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:54:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-13 03:54:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 03:54:06,921 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:06,921 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:06,921 INFO L408 AbstractCegarLoop]: === Iteration 61 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:06,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1000611222, now seen corresponding path program 21 times [2018-04-13 03:54:06,921 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:06,921 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:06,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:06,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:06,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:06,928 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:06,930 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:06,930 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:06,930 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:06,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:54:06,965 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-04-13 03:54:06,965 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:06,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:06,971 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-13 03:54:06,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:06,975 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-13 03:54:06,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:06,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:06,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:06,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:06,989 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-13 03:54:06,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:06,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:06,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:06,996 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-13 03:54:06,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:07,000 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-13 03:54:07,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:07,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:07,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 03:54:07,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 03:54:07,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 03:54:07,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:54:07,185 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 20 states. [2018-04-13 03:54:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:07,773 INFO L93 Difference]: Finished difference Result 290 states and 299 transitions. [2018-04-13 03:54:07,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 03:54:07,773 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-04-13 03:54:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:07,773 INFO L225 Difference]: With dead ends: 290 [2018-04-13 03:54:07,773 INFO L226 Difference]: Without dead ends: 290 [2018-04-13 03:54:07,774 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=1140, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:54:07,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-04-13 03:54:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 118. [2018-04-13 03:54:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-13 03:54:07,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-13 03:54:07,775 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-13 03:54:07,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:07,775 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-13 03:54:07,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 03:54:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-13 03:54:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 03:54:07,776 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:07,776 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:07,776 INFO L408 AbstractCegarLoop]: === Iteration 62 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:07,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1209617983, now seen corresponding path program 7 times [2018-04-13 03:54:07,776 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:07,776 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:07,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:07,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:07,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:07,782 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:07,785 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:07,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:07,785 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:07,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:07,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:07,805 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-13 03:54:07,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:07,810 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-13 03:54:07,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:07,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:07,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:07,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:07,822 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-13 03:54:07,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:07,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:07,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:07,828 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-13 03:54:07,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:07,832 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-13 03:54:07,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:07,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:07,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:54:07,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:54:07,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:54:07,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:54:07,971 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 19 states. [2018-04-13 03:54:08,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:08,480 INFO L93 Difference]: Finished difference Result 303 states and 313 transitions. [2018-04-13 03:54:08,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 03:54:08,480 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-04-13 03:54:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:08,481 INFO L225 Difference]: With dead ends: 303 [2018-04-13 03:54:08,481 INFO L226 Difference]: Without dead ends: 303 [2018-04-13 03:54:08,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:54:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-13 03:54:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 119. [2018-04-13 03:54:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-13 03:54:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2018-04-13 03:54:08,482 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 59 [2018-04-13 03:54:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:08,482 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2018-04-13 03:54:08,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:54:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2018-04-13 03:54:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 03:54:08,483 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:08,483 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:08,483 INFO L408 AbstractCegarLoop]: === Iteration 63 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:08,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1191728613, now seen corresponding path program 8 times [2018-04-13 03:54:08,483 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:08,483 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:08,484 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:08,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:08,484 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:08,490 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:08,493 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:08,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:08,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:08,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:54:08,504 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:54:08,504 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:08,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:08,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:54:08,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:08,514 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-13 03:54:08,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:08,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:08,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:08,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:08,526 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-13 03:54:08,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:08,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:08,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:08,532 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-13 03:54:08,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:08,535 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-13 03:54:08,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:08,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:08,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 03:54:08,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:54:08,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:54:08,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:54:08,665 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand 17 states. [2018-04-13 03:54:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:09,064 INFO L93 Difference]: Finished difference Result 305 states and 316 transitions. [2018-04-13 03:54:09,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 03:54:09,064 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-04-13 03:54:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:09,065 INFO L225 Difference]: With dead ends: 305 [2018-04-13 03:54:09,065 INFO L226 Difference]: Without dead ends: 305 [2018-04-13 03:54:09,065 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2018-04-13 03:54:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-13 03:54:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 123. [2018-04-13 03:54:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-13 03:54:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2018-04-13 03:54:09,066 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 59 [2018-04-13 03:54:09,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:09,067 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-04-13 03:54:09,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:54:09,067 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2018-04-13 03:54:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 03:54:09,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:09,067 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:09,067 INFO L408 AbstractCegarLoop]: === Iteration 64 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:09,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2099431035, now seen corresponding path program 8 times [2018-04-13 03:54:09,067 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:09,067 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:09,068 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:09,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:09,068 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:09,073 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:09,077 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:09,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:09,078 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:09,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:54:09,088 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:54:09,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:09,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:09,093 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-13 03:54:09,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:09,101 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-13 03:54:09,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:09,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:09,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:54:09,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:09,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:09,118 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-13 03:54:09,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:09,124 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-13 03:54:09,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:09,129 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-13 03:54:09,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:54:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:09,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:09,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 03:54:09,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 03:54:09,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 03:54:09,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:54:09,595 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 29 states. [2018-04-13 03:54:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:10,827 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2018-04-13 03:54:10,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 03:54:10,827 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2018-04-13 03:54:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:10,827 INFO L225 Difference]: With dead ends: 169 [2018-04-13 03:54:10,827 INFO L226 Difference]: Without dead ends: 169 [2018-04-13 03:54:10,828 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 03:54:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-13 03:54:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 128. [2018-04-13 03:54:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-13 03:54:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-13 03:54:10,829 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-13 03:54:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:10,829 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-13 03:54:10,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 03:54:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-13 03:54:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 03:54:10,830 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:10,830 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:10,830 INFO L408 AbstractCegarLoop]: === Iteration 65 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:10,830 INFO L82 PathProgramCache]: Analyzing trace with hash -855744244, now seen corresponding path program 22 times [2018-04-13 03:54:10,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:10,830 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:10,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:10,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:10,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:10,835 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:10,838 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:10,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:10,838 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:10,838 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:54:10,850 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:54:10,850 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:10,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:10,863 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-13 03:54:10,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,867 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-13 03:54:10,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:10,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:10,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:10,883 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-13 03:54:10,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,888 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-13 03:54:10,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,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-13 03:54:10,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:11,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:11,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 03:54:11,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 03:54:11,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 03:54:11,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:54:11,403 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 27 states. [2018-04-13 03:54:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:12,406 INFO L93 Difference]: Finished difference Result 209 states and 219 transitions. [2018-04-13 03:54:12,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 03:54:12,406 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-04-13 03:54:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:12,407 INFO L225 Difference]: With dead ends: 209 [2018-04-13 03:54:12,407 INFO L226 Difference]: Without dead ends: 209 [2018-04-13 03:54:12,407 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=2264, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 03:54:12,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-04-13 03:54:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 128. [2018-04-13 03:54:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-13 03:54:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-13 03:54:12,409 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-13 03:54:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:12,409 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-13 03:54:12,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 03:54:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-13 03:54:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 03:54:12,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:12,409 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:12,409 INFO L408 AbstractCegarLoop]: === Iteration 66 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:12,410 INFO L82 PathProgramCache]: Analyzing trace with hash -938410461, now seen corresponding path program 23 times [2018-04-13 03:54:12,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:12,410 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:12,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:12,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:12,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:12,415 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:12,418 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:12,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:12,418 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:12,419 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:54:12,433 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-04-13 03:54:12,433 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:12,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:12,437 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-13 03:54:12,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:12,466 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-13 03:54:12,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:12,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:12,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:12,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:12,481 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-13 03:54:12,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:12,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:12,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:12,489 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-13 03:54:12,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:12,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:12,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:54:12,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:54:12,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:12,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:12,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2018-04-13 03:54:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:12,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:12,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 03:54:12,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:54:12,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:54:12,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=700, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:54:12,910 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 28 states. [2018-04-13 03:54:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:14,244 INFO L93 Difference]: Finished difference Result 244 states and 254 transitions. [2018-04-13 03:54:14,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 03:54:14,244 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 64 [2018-04-13 03:54:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:14,245 INFO L225 Difference]: With dead ends: 244 [2018-04-13 03:54:14,245 INFO L226 Difference]: Without dead ends: 244 [2018-04-13 03:54:14,245 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 03:54:14,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-13 03:54:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 128. [2018-04-13 03:54:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-13 03:54:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-13 03:54:14,247 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-13 03:54:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:14,248 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-13 03:54:14,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:54:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-13 03:54:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 03:54:14,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:14,248 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:14,248 INFO L408 AbstractCegarLoop]: === Iteration 67 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:14,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1591234220, now seen corresponding path program 24 times [2018-04-13 03:54:14,249 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:14,249 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:14,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:14,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:14,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:14,258 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:14,263 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:14,263 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:14,263 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:14,263 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:54:14,303 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-04-13 03:54:14,304 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:14,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:14,320 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-13 03:54:14,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:14,349 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-13 03:54:14,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:14,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:14,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:14,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:14,367 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-13 03:54:14,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:14,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:14,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:14,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-13 03:54:14,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:14,381 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-13 03:54:14,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:14,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-13 03:54:14,454 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 5 treesize of output 1 [2018-04-13 03:54:14,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:14,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:14,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:14,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:21 [2018-04-13 03:54:14,589 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 11 treesize of output 1 [2018-04-13 03:54:14,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:14,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:14,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-13 03:54:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:14,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:14,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 03:54:14,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:54:14,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:54:14,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:54:14,836 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 28 states. [2018-04-13 03:54:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:15,758 INFO L93 Difference]: Finished difference Result 274 states and 284 transitions. [2018-04-13 03:54:15,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:54:15,759 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 64 [2018-04-13 03:54:15,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:15,759 INFO L225 Difference]: With dead ends: 274 [2018-04-13 03:54:15,760 INFO L226 Difference]: Without dead ends: 274 [2018-04-13 03:54:15,760 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=2453, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 03:54:15,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-13 03:54:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 128. [2018-04-13 03:54:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-13 03:54:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-13 03:54:15,761 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-13 03:54:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:15,761 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-13 03:54:15,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:54:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-13 03:54:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 03:54:15,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:15,762 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:15,762 INFO L408 AbstractCegarLoop]: === Iteration 68 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:15,762 INFO L82 PathProgramCache]: Analyzing trace with hash 534842499, now seen corresponding path program 25 times [2018-04-13 03:54:15,762 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:15,762 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:15,762 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:15,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:15,762 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:15,767 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:15,769 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:15,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:15,769 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:15,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:15,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:15,809 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-13 03:54:15,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:15,814 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-13 03:54:15,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:15,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:15,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:15,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:15,834 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-13 03:54:15,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:15,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:15,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:15,841 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-13 03:54:15,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:15,844 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-13 03:54:15,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:16,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:16,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 03:54:16,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 03:54:16,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 03:54:16,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:54:16,128 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 26 states. [2018-04-13 03:54:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:17,047 INFO L93 Difference]: Finished difference Result 299 states and 309 transitions. [2018-04-13 03:54:17,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 03:54:17,047 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 64 [2018-04-13 03:54:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:17,048 INFO L225 Difference]: With dead ends: 299 [2018-04-13 03:54:17,048 INFO L226 Difference]: Without dead ends: 299 [2018-04-13 03:54:17,049 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=2172, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 03:54:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-04-13 03:54:17,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 128. [2018-04-13 03:54:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-13 03:54:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-13 03:54:17,051 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-13 03:54:17,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:17,051 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-13 03:54:17,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 03:54:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-13 03:54:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 03:54:17,052 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:17,052 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:17,052 INFO L408 AbstractCegarLoop]: === Iteration 69 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:17,052 INFO L82 PathProgramCache]: Analyzing trace with hash 34653260, now seen corresponding path program 26 times [2018-04-13 03:54:17,052 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:17,052 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:17,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:17,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:17,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:17,063 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:17,066 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:17,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:17,066 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:17,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:54:17,095 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:54:17,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:17,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:17,108 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-13 03:54:17,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:17,113 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-13 03:54:17,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:17,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:17,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:17,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:17,133 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-13 03:54:17,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:17,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:17,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:17,146 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-13 03:54:17,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:17,150 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-13 03:54:17,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:17,411 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:17,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:17,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 03:54:17,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 03:54:17,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 03:54:17,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:54:17,412 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 23 states. [2018-04-13 03:54:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:18,241 INFO L93 Difference]: Finished difference Result 319 states and 329 transitions. [2018-04-13 03:54:18,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 03:54:18,241 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-04-13 03:54:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:18,242 INFO L225 Difference]: With dead ends: 319 [2018-04-13 03:54:18,242 INFO L226 Difference]: Without dead ends: 319 [2018-04-13 03:54:18,242 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=1576, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 03:54:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-13 03:54:18,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 128. [2018-04-13 03:54:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-13 03:54:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-13 03:54:18,244 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-13 03:54:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:18,244 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-13 03:54:18,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 03:54:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-13 03:54:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 03:54:18,244 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:18,244 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:18,245 INFO L408 AbstractCegarLoop]: === Iteration 70 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash 392008419, now seen corresponding path program 27 times [2018-04-13 03:54:18,245 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:18,245 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:18,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:18,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:18,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:18,252 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:18,254 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:18,254 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:18,254 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:18,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:54:18,302 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-04-13 03:54:18,302 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:18,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:18,318 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-13 03:54:18,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:18,323 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-13 03:54:18,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:18,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:18,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:18,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:18,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:18,338 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-13 03:54:18,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:18,343 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-13 03:54:18,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:18,347 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-13 03:54:18,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:18,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:18,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 03:54:18,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 03:54:18,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 03:54:18,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:54:18,566 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 22 states. [2018-04-13 03:54:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:19,302 INFO L93 Difference]: Finished difference Result 334 states and 344 transitions. [2018-04-13 03:54:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:54:19,302 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2018-04-13 03:54:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:19,303 INFO L225 Difference]: With dead ends: 334 [2018-04-13 03:54:19,303 INFO L226 Difference]: Without dead ends: 334 [2018-04-13 03:54:19,303 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=1424, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 03:54:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-13 03:54:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 128. [2018-04-13 03:54:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-13 03:54:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-13 03:54:19,305 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-13 03:54:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:19,305 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-13 03:54:19,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 03:54:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-13 03:54:19,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 03:54:19,306 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:19,306 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:19,306 INFO L408 AbstractCegarLoop]: === Iteration 71 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:19,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1716403732, now seen corresponding path program 28 times [2018-04-13 03:54:19,306 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:19,306 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:19,307 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:19,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:19,307 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:19,317 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:19,320 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:19,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:19,320 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:19,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:54:19,345 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:54:19,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:19,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:19,360 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-13 03:54:19,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:19,365 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-13 03:54:19,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:19,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:19,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:19,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:19,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-13 03:54:19,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:19,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:19,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:19,391 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-13 03:54:19,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:19,396 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-13 03:54:19,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:19,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:19,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 03:54:19,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:54:19,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:54:19,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:54:19,645 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 21 states. [2018-04-13 03:54:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:20,349 INFO L93 Difference]: Finished difference Result 345 states and 355 transitions. [2018-04-13 03:54:20,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 03:54:20,349 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-04-13 03:54:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:20,350 INFO L225 Difference]: With dead ends: 345 [2018-04-13 03:54:20,350 INFO L226 Difference]: Without dead ends: 345 [2018-04-13 03:54:20,350 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:54:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-04-13 03:54:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 128. [2018-04-13 03:54:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-13 03:54:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-13 03:54:20,352 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-13 03:54:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:20,352 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-13 03:54:20,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:54:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-13 03:54:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 03:54:20,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:20,352 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:20,352 INFO L408 AbstractCegarLoop]: === Iteration 72 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:20,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1925410493, now seen corresponding path program 8 times [2018-04-13 03:54:20,352 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:20,353 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:20,353 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:20,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:20,353 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:20,360 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:20,365 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:20,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:20,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:20,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:54:20,406 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:54:20,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:20,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:20,428 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-13 03:54:20,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:20,434 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-13 03:54:20,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:20,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:20,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:20,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:20,453 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-13 03:54:20,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:20,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:20,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:20,464 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-13 03:54:20,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:20,469 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-13 03:54:20,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:20,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:20,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 03:54:20,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 03:54:20,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 03:54:20,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:54:20,672 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 20 states. [2018-04-13 03:54:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:21,251 INFO L93 Difference]: Finished difference Result 358 states and 369 transitions. [2018-04-13 03:54:21,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 03:54:21,251 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-04-13 03:54:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:21,252 INFO L225 Difference]: With dead ends: 358 [2018-04-13 03:54:21,252 INFO L226 Difference]: Without dead ends: 358 [2018-04-13 03:54:21,252 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:54:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-13 03:54:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 129. [2018-04-13 03:54:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-13 03:54:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2018-04-13 03:54:21,253 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 64 [2018-04-13 03:54:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:21,253 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-04-13 03:54:21,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 03:54:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2018-04-13 03:54:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 03:54:21,254 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:21,254 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:21,254 INFO L408 AbstractCegarLoop]: === Iteration 73 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:21,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1907521123, now seen corresponding path program 9 times [2018-04-13 03:54:21,254 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:21,254 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:21,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:21,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:21,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:21,261 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:21,262 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:21,262 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:21,262 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:21,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:54:21,292 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-13 03:54:21,292 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:21,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:21,313 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-13 03:54:21,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:21,318 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-13 03:54:21,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:21,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:21,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:21,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:21,336 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-13 03:54:21,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:21,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:21,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:21,346 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-13 03:54:21,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:21,350 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-13 03:54:21,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:21,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:21,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 03:54:21,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 03:54:21,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 03:54:21,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-04-13 03:54:21,512 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 18 states. [2018-04-13 03:54:21,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:21,975 INFO L93 Difference]: Finished difference Result 360 states and 372 transitions. [2018-04-13 03:54:21,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 03:54:21,975 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2018-04-13 03:54:21,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:21,976 INFO L225 Difference]: With dead ends: 360 [2018-04-13 03:54:21,976 INFO L226 Difference]: Without dead ends: 360 [2018-04-13 03:54:21,976 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:54:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-04-13 03:54:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 133. [2018-04-13 03:54:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-13 03:54:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2018-04-13 03:54:21,978 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 64 [2018-04-13 03:54:21,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:21,978 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2018-04-13 03:54:21,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 03:54:21,978 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2018-04-13 03:54:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 03:54:21,979 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:21,979 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:21,979 INFO L408 AbstractCegarLoop]: === Iteration 74 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:21,979 INFO L82 PathProgramCache]: Analyzing trace with hash -450005848, now seen corresponding path program 9 times [2018-04-13 03:54:21,979 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:21,979 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:21,980 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:21,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:21,980 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:21,988 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:21,994 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:21,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:21,994 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:21,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:54:22,017 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-13 03:54:22,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:22,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:22,023 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-13 03:54:22,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:22,027 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-13 03:54:22,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:22,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:22,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:22,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:22,040 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-13 03:54:22,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:22,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:22,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:22,049 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-13 03:54:22,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:22,053 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-13 03:54:22,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:22,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:22,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 03:54:22,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 03:54:22,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 03:54:22,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:54:22,436 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand 31 states. [2018-04-13 03:54:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:23,327 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2018-04-13 03:54:23,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 03:54:23,327 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2018-04-13 03:54:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:23,327 INFO L225 Difference]: With dead ends: 184 [2018-04-13 03:54:23,327 INFO L226 Difference]: Without dead ends: 184 [2018-04-13 03:54:23,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=229, Invalid=3193, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 03:54:23,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-13 03:54:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 138. [2018-04-13 03:54:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-13 03:54:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-13 03:54:23,329 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-13 03:54:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:23,329 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-13 03:54:23,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 03:54:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-13 03:54:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 03:54:23,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:23,329 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:23,329 INFO L408 AbstractCegarLoop]: === Iteration 75 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:23,329 INFO L82 PathProgramCache]: Analyzing trace with hash 990570881, now seen corresponding path program 29 times [2018-04-13 03:54:23,330 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:23,330 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:23,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:23,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:23,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:23,335 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:23,338 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:23,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:23,338 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:23,338 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:54:23,360 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-04-13 03:54:23,360 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:23,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:23,379 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-13 03:54:23,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:23,385 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-13 03:54:23,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:23,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:23,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:23,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:23,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:23,403 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-13 03:54:23,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:23,421 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-13 03:54:23,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:23,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:23,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:54:23,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:54:23,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:23,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:23,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:14 [2018-04-13 03:54:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:23,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:23,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 03:54:23,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 03:54:23,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 03:54:23,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:54:23,930 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 31 states. [2018-04-13 03:54:25,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:25,506 INFO L93 Difference]: Finished difference Result 229 states and 240 transitions. [2018-04-13 03:54:25,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 03:54:25,507 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2018-04-13 03:54:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:25,507 INFO L225 Difference]: With dead ends: 229 [2018-04-13 03:54:25,507 INFO L226 Difference]: Without dead ends: 229 [2018-04-13 03:54:25,507 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=231, Invalid=3309, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 03:54:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-13 03:54:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 138. [2018-04-13 03:54:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-13 03:54:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-13 03:54:25,509 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-13 03:54:25,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:25,509 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-13 03:54:25,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 03:54:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-13 03:54:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 03:54:25,509 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:25,509 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:25,509 INFO L408 AbstractCegarLoop]: === Iteration 76 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:25,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1800528586, now seen corresponding path program 30 times [2018-04-13 03:54:25,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:25,509 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:25,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:25,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:25,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:25,515 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:25,518 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:25,518 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:25,518 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:25,518 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:54:25,540 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-04-13 03:54:25,540 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:25,544 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:25,546 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-13 03:54:25,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:25,550 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-13 03:54:25,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:25,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:25,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:25,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:25,565 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-13 03:54:25,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:25,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:25,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:25,581 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-13 03:54:25,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:25,586 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-13 03:54:25,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:54:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:25,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:25,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-13 03:54:25,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 03:54:25,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 03:54:25,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-04-13 03:54:25,931 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 30 states. [2018-04-13 03:54:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:26,909 INFO L93 Difference]: Finished difference Result 269 states and 280 transitions. [2018-04-13 03:54:26,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 03:54:26,910 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 69 [2018-04-13 03:54:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:26,910 INFO L225 Difference]: With dead ends: 269 [2018-04-13 03:54:26,910 INFO L226 Difference]: Without dead ends: 269 [2018-04-13 03:54:26,911 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=3087, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 03:54:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-13 03:54:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 138. [2018-04-13 03:54:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-13 03:54:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-13 03:54:26,912 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-13 03:54:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:26,912 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-13 03:54:26,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 03:54:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-13 03:54:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 03:54:26,912 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:26,912 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:26,912 INFO L408 AbstractCegarLoop]: === Iteration 77 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:26,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1717862369, now seen corresponding path program 31 times [2018-04-13 03:54:26,913 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:26,913 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:26,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:26,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:26,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:26,918 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:26,921 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:26,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:26,921 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:26,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:26,944 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:26,952 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-13 03:54:26,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:26,957 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-13 03:54:26,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:26,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:26,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:26,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:26,977 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-13 03:54:26,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:26,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:26,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:26,988 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-13 03:54:26,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:26,992 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-13 03:54:26,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:27,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:27,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 03:54:27,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:54:27,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:54:27,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:54:27,268 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 28 states. [2018-04-13 03:54:28,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:28,190 INFO L93 Difference]: Finished difference Result 304 states and 315 transitions. [2018-04-13 03:54:28,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:54:28,190 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2018-04-13 03:54:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:28,191 INFO L225 Difference]: With dead ends: 304 [2018-04-13 03:54:28,191 INFO L226 Difference]: Without dead ends: 304 [2018-04-13 03:54:28,191 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=2459, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 03:54:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-04-13 03:54:28,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 138. [2018-04-13 03:54:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-13 03:54:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-13 03:54:28,193 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-13 03:54:28,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:28,193 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-13 03:54:28,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:54:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-13 03:54:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 03:54:28,193 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:28,194 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:28,194 INFO L408 AbstractCegarLoop]: === Iteration 78 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:28,194 INFO L82 PathProgramCache]: Analyzing trace with hash -47460246, now seen corresponding path program 32 times [2018-04-13 03:54:28,194 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:28,194 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:28,194 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:28,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:28,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:28,200 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:28,202 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:28,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:28,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:28,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:54:28,216 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:54:28,216 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:28,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:28,221 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-13 03:54:28,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:28,224 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-13 03:54:28,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:28,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:28,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:28,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:28,235 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-13 03:54:28,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:28,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:28,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:28,242 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-13 03:54:28,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:28,253 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-13 03:54:28,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:28,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:28,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 03:54:28,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 03:54:28,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 03:54:28,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:54:28,613 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 26 states. [2018-04-13 03:54:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:29,594 INFO L93 Difference]: Finished difference Result 334 states and 345 transitions. [2018-04-13 03:54:29,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 03:54:29,595 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-04-13 03:54:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:29,595 INFO L225 Difference]: With dead ends: 334 [2018-04-13 03:54:29,595 INFO L226 Difference]: Without dead ends: 334 [2018-04-13 03:54:29,595 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=2084, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 03:54:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-13 03:54:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 138. [2018-04-13 03:54:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-13 03:54:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-13 03:54:29,597 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-13 03:54:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:29,597 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-13 03:54:29,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 03:54:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-13 03:54:29,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 03:54:29,597 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:29,597 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:29,597 INFO L408 AbstractCegarLoop]: === Iteration 79 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:29,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1103851967, now seen corresponding path program 33 times [2018-04-13 03:54:29,598 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:29,598 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:29,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:29,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:29,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:29,604 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:29,605 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:29,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:29,605 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:29,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:54:29,638 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-13 03:54:29,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:29,642 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:29,644 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-13 03:54:29,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:29,651 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-13 03:54:29,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:29,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:29,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:29,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:29,665 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-13 03:54:29,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:29,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:29,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:29,673 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-13 03:54:29,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:29,677 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-13 03:54:29,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:29,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:29,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 03:54:29,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 03:54:29,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 03:54:29,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:54:29,956 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 26 states. [2018-04-13 03:54:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:30,833 INFO L93 Difference]: Finished difference Result 359 states and 370 transitions. [2018-04-13 03:54:30,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 03:54:30,833 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-04-13 03:54:30,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:30,834 INFO L225 Difference]: With dead ends: 359 [2018-04-13 03:54:30,834 INFO L226 Difference]: Without dead ends: 359 [2018-04-13 03:54:30,834 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=2173, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 03:54:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-04-13 03:54:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 138. [2018-04-13 03:54:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-13 03:54:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-13 03:54:30,836 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-13 03:54:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:30,836 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-13 03:54:30,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 03:54:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-13 03:54:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 03:54:30,836 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:30,836 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:30,836 INFO L408 AbstractCegarLoop]: === Iteration 80 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:30,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1604041206, now seen corresponding path program 34 times [2018-04-13 03:54:30,836 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:30,836 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:30,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:30,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:30,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:30,843 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:30,845 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:30,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:30,846 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:30,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:54:30,875 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:54:30,875 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:30,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:30,884 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-13 03:54:30,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:30,888 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-13 03:54:30,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:30,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:30,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:30,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:30,900 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-13 03:54:30,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:30,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:30,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:30,907 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-13 03:54:30,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:30,910 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-13 03:54:30,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:31,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:31,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 03:54:31,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 03:54:31,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 03:54:31,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:54:31,221 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 25 states. [2018-04-13 03:54:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:32,127 INFO L93 Difference]: Finished difference Result 379 states and 390 transitions. [2018-04-13 03:54:32,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 03:54:32,154 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 69 [2018-04-13 03:54:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:32,154 INFO L225 Difference]: With dead ends: 379 [2018-04-13 03:54:32,154 INFO L226 Difference]: Without dead ends: 379 [2018-04-13 03:54:32,155 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=1997, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 03:54:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-13 03:54:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 138. [2018-04-13 03:54:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-13 03:54:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-13 03:54:32,156 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-13 03:54:32,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:32,156 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-13 03:54:32,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 03:54:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-13 03:54:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 03:54:32,157 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:32,157 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:32,157 INFO L408 AbstractCegarLoop]: === Iteration 81 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:32,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1246686047, now seen corresponding path program 35 times [2018-04-13 03:54:32,157 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:32,157 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:32,157 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:32,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:32,157 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:32,163 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:32,165 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:32,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:32,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:32,166 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:54:32,211 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-04-13 03:54:32,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:32,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:32,233 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-13 03:54:32,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:32,238 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-13 03:54:32,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:32,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:32,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:32,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:32,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:32,249 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 17 treesize of output 24 [2018-04-13 03:54:32,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:32,255 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-13 03:54:32,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:32,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:32,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:54:32,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:54:32,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:32,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:32,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2018-04-13 03:54:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:32,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:32,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 03:54:32,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 03:54:32,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 03:54:32,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:54:32,538 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 23 states. [2018-04-13 03:54:33,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:33,454 INFO L93 Difference]: Finished difference Result 394 states and 405 transitions. [2018-04-13 03:54:33,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 03:54:33,454 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-04-13 03:54:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:33,455 INFO L225 Difference]: With dead ends: 394 [2018-04-13 03:54:33,455 INFO L226 Difference]: Without dead ends: 394 [2018-04-13 03:54:33,455 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=1583, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 03:54:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-13 03:54:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 138. [2018-04-13 03:54:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-13 03:54:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-13 03:54:33,456 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-13 03:54:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:33,457 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-13 03:54:33,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 03:54:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-13 03:54:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 03:54:33,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:33,457 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:33,457 INFO L408 AbstractCegarLoop]: === Iteration 82 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:33,457 INFO L82 PathProgramCache]: Analyzing trace with hash 939869098, now seen corresponding path program 36 times [2018-04-13 03:54:33,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:33,457 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:33,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:33,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:33,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:33,464 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:33,466 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:33,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:33,466 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:33,467 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:54:33,493 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-04-13 03:54:33,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:33,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:33,499 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-13 03:54:33,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:33,503 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-13 03:54:33,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:33,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:33,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:33,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:33,514 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-13 03:54:33,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:33,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:33,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:33,520 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-13 03:54:33,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:33,523 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-13 03:54:33,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:33,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:33,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 03:54:33,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 03:54:33,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 03:54:33,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:54:33,712 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 22 states. [2018-04-13 03:54:34,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:34,485 INFO L93 Difference]: Finished difference Result 405 states and 416 transitions. [2018-04-13 03:54:34,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:54:34,485 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-04-13 03:54:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:34,486 INFO L225 Difference]: With dead ends: 405 [2018-04-13 03:54:34,486 INFO L226 Difference]: Without dead ends: 405 [2018-04-13 03:54:34,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=1428, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 03:54:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-04-13 03:54:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 138. [2018-04-13 03:54:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-13 03:54:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-13 03:54:34,487 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-13 03:54:34,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:34,488 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-13 03:54:34,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 03:54:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-13 03:54:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 03:54:34,488 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:34,488 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:34,488 INFO L408 AbstractCegarLoop]: === Iteration 83 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:34,488 INFO L82 PathProgramCache]: Analyzing trace with hash 730862337, now seen corresponding path program 9 times [2018-04-13 03:54:34,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:34,488 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:34,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:34,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:34,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:34,502 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:34,508 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:34,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:34,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:34,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:54:34,573 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-13 03:54:34,574 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:34,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:34,587 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-13 03:54:34,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,592 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-13 03:54:34,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:34,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:34,606 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-13 03:54:34,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:34,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:34,613 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-13 03:54:34,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,617 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-13 03:54:34,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:34,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:34,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 03:54:34,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:54:34,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:54:34,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:54:34,808 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 21 states. [2018-04-13 03:54:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:35,528 INFO L93 Difference]: Finished difference Result 418 states and 430 transitions. [2018-04-13 03:54:35,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 03:54:35,528 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-04-13 03:54:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:35,529 INFO L225 Difference]: With dead ends: 418 [2018-04-13 03:54:35,529 INFO L226 Difference]: Without dead ends: 418 [2018-04-13 03:54:35,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:54:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-04-13 03:54:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 139. [2018-04-13 03:54:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-13 03:54:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2018-04-13 03:54:35,531 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 69 [2018-04-13 03:54:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:35,531 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2018-04-13 03:54:35,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:54:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2018-04-13 03:54:35,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 03:54:35,532 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:35,532 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:35,532 INFO L408 AbstractCegarLoop]: === Iteration 84 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:35,532 INFO L82 PathProgramCache]: Analyzing trace with hash 748751707, now seen corresponding path program 10 times [2018-04-13 03:54:35,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:35,532 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:35,532 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:35,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:35,532 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:35,539 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:35,541 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:35,541 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:35,541 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:35,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:54:35,576 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:54:35,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:35,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:35,595 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-13 03:54:35,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:35,600 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-13 03:54:35,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:35,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:35,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:35,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:35,618 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-13 03:54:35,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:35,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:35,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:35,627 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-13 03:54:35,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:35,630 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-13 03:54:35,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:35,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:35,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:54:35,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:54:35,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:54:35,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:54:35,754 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand 19 states. [2018-04-13 03:54:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:36,266 INFO L93 Difference]: Finished difference Result 420 states and 433 transitions. [2018-04-13 03:54:36,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 03:54:36,266 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-04-13 03:54:36,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:36,267 INFO L225 Difference]: With dead ends: 420 [2018-04-13 03:54:36,267 INFO L226 Difference]: Without dead ends: 420 [2018-04-13 03:54:36,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:54:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-04-13 03:54:36,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 143. [2018-04-13 03:54:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-13 03:54:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2018-04-13 03:54:36,269 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 69 [2018-04-13 03:54:36,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:36,269 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2018-04-13 03:54:36,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:54:36,269 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2018-04-13 03:54:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 03:54:36,269 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:36,269 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:36,269 INFO L408 AbstractCegarLoop]: === Iteration 85 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:36,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1585690469, now seen corresponding path program 10 times [2018-04-13 03:54:36,269 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:36,269 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:36,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:36,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:36,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:36,275 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:36,279 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:36,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:36,279 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:36,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:54:36,290 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:54:36,290 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:36,292 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:36,295 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-13 03:54:36,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:36,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:36,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 03:54:36,309 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 03:54:36,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 03:54:36,317 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 2 xjuncts. [2018-04-13 03:54:36,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-04-13 03:54:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:37,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:37,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 03:54:37,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 03:54:37,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 03:54:37,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1256, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 03:54:37,124 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand 37 states. [2018-04-13 03:54:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:39,883 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2018-04-13 03:54:39,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 03:54:39,884 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2018-04-13 03:54:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:39,884 INFO L225 Difference]: With dead ends: 204 [2018-04-13 03:54:39,884 INFO L226 Difference]: Without dead ends: 204 [2018-04-13 03:54:39,885 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=277, Invalid=4553, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 03:54:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-13 03:54:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 148. [2018-04-13 03:54:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 03:54:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-13 03:54:39,886 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-13 03:54:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:39,886 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-13 03:54:39,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 03:54:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-13 03:54:39,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 03:54:39,886 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:39,886 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:39,887 INFO L408 AbstractCegarLoop]: === Iteration 86 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:39,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1755336669, now seen corresponding path program 4 times [2018-04-13 03:54:39,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:39,887 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:39,887 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:39,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:39,887 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:39,893 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:39,895 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:39,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:39,896 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:39,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:54:39,906 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:54:39,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:39,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:39,910 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-13 03:54:39,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:39,922 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-13 03:54:39,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:39,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:39,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:39,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:39,933 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-13 03:54:39,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:39,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:39,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:39,940 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-13 03:54:39,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:39,943 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-13 03:54:39,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:40,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:40,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 03:54:40,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 03:54:40,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 03:54:40,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:54:40,328 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 33 states. [2018-04-13 03:54:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:41,308 INFO L93 Difference]: Finished difference Result 253 states and 265 transitions. [2018-04-13 03:54:41,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 03:54:41,309 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2018-04-13 03:54:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:41,309 INFO L225 Difference]: With dead ends: 253 [2018-04-13 03:54:41,309 INFO L226 Difference]: Without dead ends: 253 [2018-04-13 03:54:41,310 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=239, Invalid=3543, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 03:54:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-13 03:54:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 148. [2018-04-13 03:54:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 03:54:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-13 03:54:41,311 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-13 03:54:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:41,311 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-13 03:54:41,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 03:54:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-13 03:54:41,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 03:54:41,312 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:41,312 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:41,312 INFO L408 AbstractCegarLoop]: === Iteration 87 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1891999188, now seen corresponding path program 37 times [2018-04-13 03:54:41,312 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:41,312 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:41,313 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:41,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:41,313 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:41,318 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:41,322 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:41,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:41,322 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:41,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:41,343 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:41,345 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-13 03:54:41,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:41,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-13 03:54:41,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:41,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:41,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:41,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:41,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:41,382 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-13 03:54:41,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:41,387 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-13 03:54:41,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:41,391 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-13 03:54:41,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:42,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:42,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 03:54:42,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 03:54:42,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 03:54:42,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:54:42,108 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 31 states. [2018-04-13 03:54:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:43,546 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2018-04-13 03:54:43,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 03:54:43,546 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 74 [2018-04-13 03:54:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:43,547 INFO L225 Difference]: With dead ends: 249 [2018-04-13 03:54:43,547 INFO L226 Difference]: Without dead ends: 249 [2018-04-13 03:54:43,547 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=218, Invalid=3088, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 03:54:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-13 03:54:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 148. [2018-04-13 03:54:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 03:54:43,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-13 03:54:43,549 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-13 03:54:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:43,549 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-13 03:54:43,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 03:54:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-13 03:54:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 03:54:43,549 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:43,550 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:43,550 INFO L408 AbstractCegarLoop]: === Iteration 88 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash -34025853, now seen corresponding path program 38 times [2018-04-13 03:54:43,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:43,550 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:43,550 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:43,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:43,551 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:43,560 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:43,565 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:43,565 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:43,565 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:43,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:54:43,583 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:54:43,583 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:43,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:43,587 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-13 03:54:43,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:43,592 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-13 03:54:43,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:43,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:43,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:43,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:43,604 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-13 03:54:43,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:43,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:43,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:43,610 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-13 03:54:43,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:43,613 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-13 03:54:43,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:44,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:44,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-13 03:54:44,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 03:54:44,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 03:54:44,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-04-13 03:54:44,224 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 30 states. [2018-04-13 03:54:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:45,668 INFO L93 Difference]: Finished difference Result 294 states and 306 transitions. [2018-04-13 03:54:45,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 03:54:45,668 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 74 [2018-04-13 03:54:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:45,669 INFO L225 Difference]: With dead ends: 294 [2018-04-13 03:54:45,669 INFO L226 Difference]: Without dead ends: 294 [2018-04-13 03:54:45,669 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=208, Invalid=2872, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 03:54:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-04-13 03:54:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 148. [2018-04-13 03:54:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 03:54:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-13 03:54:45,671 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-13 03:54:45,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:45,671 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-13 03:54:45,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 03:54:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-13 03:54:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 03:54:45,671 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:45,671 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:45,671 INFO L408 AbstractCegarLoop]: === Iteration 89 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:45,671 INFO L82 PathProgramCache]: Analyzing trace with hash 775931852, now seen corresponding path program 39 times [2018-04-13 03:54:45,671 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:45,671 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:45,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:45,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:45,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:45,681 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:45,685 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:45,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:45,685 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:45,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:54:45,711 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-13 03:54:45,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:45,716 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:45,718 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-13 03:54:45,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:45,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 6 treesize of output 5 [2018-04-13 03:54:45,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:45,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:45,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:45,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:45,736 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-13 03:54:45,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:45,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:45,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:45,745 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 17 treesize of output 24 [2018-04-13 03:54:45,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:45,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:45,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:54:45,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:54:45,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:45,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:45,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 03:54:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:46,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:46,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-13 03:54:46,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 03:54:46,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 03:54:46,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=928, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:54:46,296 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 32 states. [2018-04-13 03:54:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:48,144 INFO L93 Difference]: Finished difference Result 334 states and 346 transitions. [2018-04-13 03:54:48,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:54:48,144 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 74 [2018-04-13 03:54:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:48,145 INFO L225 Difference]: With dead ends: 334 [2018-04-13 03:54:48,145 INFO L226 Difference]: Without dead ends: 334 [2018-04-13 03:54:48,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=240, Invalid=3542, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 03:54:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-13 03:54:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 148. [2018-04-13 03:54:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 03:54:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-13 03:54:48,147 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-13 03:54:48,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:48,147 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-13 03:54:48,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 03:54:48,147 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-13 03:54:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 03:54:48,147 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:48,147 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:48,147 INFO L408 AbstractCegarLoop]: === Iteration 90 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:48,147 INFO L82 PathProgramCache]: Analyzing trace with hash 693265635, now seen corresponding path program 40 times [2018-04-13 03:54:48,147 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:48,147 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:48,148 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:48,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:48,148 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:48,155 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:48,156 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:48,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:48,156 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:48,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:54:48,174 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:54:48,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:48,177 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:48,179 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-13 03:54:48,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:48,183 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-13 03:54:48,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:48,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:48,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:48,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:48,194 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-13 03:54:48,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:48,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:48,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:48,201 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-13 03:54:48,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:48,204 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-13 03:54:48,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:48,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:48,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 03:54:48,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:54:48,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:54:48,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:54:48,660 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 28 states. [2018-04-13 03:54:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:49,928 INFO L93 Difference]: Finished difference Result 369 states and 381 transitions. [2018-04-13 03:54:49,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:54:49,928 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2018-04-13 03:54:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:49,929 INFO L225 Difference]: With dead ends: 369 [2018-04-13 03:54:49,929 INFO L226 Difference]: Without dead ends: 369 [2018-04-13 03:54:49,929 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=2468, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 03:54:49,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-04-13 03:54:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 148. [2018-04-13 03:54:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 03:54:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-13 03:54:49,931 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-13 03:54:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:49,931 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-13 03:54:49,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:54:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-13 03:54:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 03:54:49,931 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:49,931 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:49,931 INFO L408 AbstractCegarLoop]: === Iteration 91 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:49,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1072056980, now seen corresponding path program 41 times [2018-04-13 03:54:49,932 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:49,932 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:49,932 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:49,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:49,932 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:49,938 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:49,940 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:49,940 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:49,940 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:49,940 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:54:49,969 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 03:54:49,969 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:49,973 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:49,983 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-13 03:54:49,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:49,987 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-13 03:54:49,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:49,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:49,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:50,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:50,001 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-13 03:54:50,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:50,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:50,010 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-13 03:54:50,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:50,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:54:50,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:54:50,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2018-04-13 03:54:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:50,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:50,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 03:54:50,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 03:54:50,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 03:54:50,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:54:50,503 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 29 states. [2018-04-13 03:54:52,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:52,186 INFO L93 Difference]: Finished difference Result 399 states and 411 transitions. [2018-04-13 03:54:52,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 03:54:52,186 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 74 [2018-04-13 03:54:52,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:52,187 INFO L225 Difference]: With dead ends: 399 [2018-04-13 03:54:52,187 INFO L226 Difference]: Without dead ends: 399 [2018-04-13 03:54:52,187 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=203, Invalid=2767, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 03:54:52,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-04-13 03:54:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 148. [2018-04-13 03:54:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 03:54:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-13 03:54:52,188 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-13 03:54:52,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:52,189 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-13 03:54:52,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 03:54:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-13 03:54:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 03:54:52,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:52,189 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:52,189 INFO L408 AbstractCegarLoop]: === Iteration 92 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash -2128448701, now seen corresponding path program 42 times [2018-04-13 03:54:52,189 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:52,189 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:52,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:52,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:52,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:52,196 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:52,198 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:52,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:52,199 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:52,199 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:54:52,238 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-13 03:54:52,238 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:52,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:52,246 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-13 03:54:52,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:52,249 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-13 03:54:52,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:52,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:52,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:52,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:52,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:52,269 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-13 03:54:52,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:52,274 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-13 03:54:52,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:52,277 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-13 03:54:52,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:52,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:52,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 03:54:52,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 03:54:52,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 03:54:52,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:54:52,519 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 26 states. [2018-04-13 03:54:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:53,414 INFO L93 Difference]: Finished difference Result 424 states and 436 transitions. [2018-04-13 03:54:53,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 03:54:53,427 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 74 [2018-04-13 03:54:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:53,428 INFO L225 Difference]: With dead ends: 424 [2018-04-13 03:54:53,428 INFO L226 Difference]: Without dead ends: 424 [2018-04-13 03:54:53,428 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=2088, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 03:54:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-04-13 03:54:53,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 148. [2018-04-13 03:54:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 03:54:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-13 03:54:53,430 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-13 03:54:53,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:53,430 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-13 03:54:53,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 03:54:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-13 03:54:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 03:54:53,430 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:53,430 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:53,430 INFO L408 AbstractCegarLoop]: === Iteration 93 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:53,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1666329356, now seen corresponding path program 43 times [2018-04-13 03:54:53,431 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:53,431 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:53,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:53,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:53,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:53,438 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:53,440 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:53,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:53,440 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:53,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:53,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:53,471 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-13 03:54:53,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:53,475 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-13 03:54:53,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:53,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:53,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:53,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:53,488 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-13 03:54:53,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:53,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:53,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:53,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, 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-13 03:54:53,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:53,502 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-13 03:54:53,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:53,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:53,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 03:54:53,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 03:54:53,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 03:54:53,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:54:53,774 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 25 states. [2018-04-13 03:54:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:54,765 INFO L93 Difference]: Finished difference Result 444 states and 456 transitions. [2018-04-13 03:54:54,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 03:54:54,765 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-04-13 03:54:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:54,766 INFO L225 Difference]: With dead ends: 444 [2018-04-13 03:54:54,766 INFO L226 Difference]: Without dead ends: 444 [2018-04-13 03:54:54,766 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=1912, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 03:54:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-04-13 03:54:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 148. [2018-04-13 03:54:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 03:54:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-13 03:54:54,768 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-13 03:54:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:54,768 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-13 03:54:54,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 03:54:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-13 03:54:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 03:54:54,768 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:54,768 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:54,768 INFO L408 AbstractCegarLoop]: === Iteration 94 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:54,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2023684515, now seen corresponding path program 44 times [2018-04-13 03:54:54,768 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:54,769 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:54,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:54,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:54,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:54,775 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:54,777 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:54,777 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:54,777 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:54,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:54:54,797 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:54:54,797 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:54,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:54,802 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-13 03:54:54,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:54,806 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-13 03:54:54,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:54,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:54,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:54,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:54,818 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-13 03:54:54,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:54,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:54,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:54,824 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-13 03:54:54,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:54,828 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-13 03:54:54,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:55,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:55,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 03:54:55,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 03:54:55,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 03:54:55,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:54:55,073 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 24 states. [2018-04-13 03:54:55,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:55,954 INFO L93 Difference]: Finished difference Result 459 states and 471 transitions. [2018-04-13 03:54:55,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 03:54:55,954 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-04-13 03:54:55,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:55,955 INFO L225 Difference]: With dead ends: 459 [2018-04-13 03:54:55,955 INFO L226 Difference]: Without dead ends: 459 [2018-04-13 03:54:55,956 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=1744, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 03:54:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-04-13 03:54:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 148. [2018-04-13 03:54:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 03:54:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-13 03:54:55,957 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-13 03:54:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:55,957 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-13 03:54:55,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 03:54:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-13 03:54:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 03:54:55,958 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:55,958 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:55,958 INFO L408 AbstractCegarLoop]: === Iteration 95 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:55,958 INFO L82 PathProgramCache]: Analyzing trace with hash -84727636, now seen corresponding path program 45 times [2018-04-13 03:54:55,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:55,958 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:55,959 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:55,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:55,959 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:55,966 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:55,968 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:55,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:55,968 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:55,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:54:56,016 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-13 03:54:56,016 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:56,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:56,024 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-13 03:54:56,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:56,027 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-13 03:54:56,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:56,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:56,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:56,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:56,039 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-13 03:54:56,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:56,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:56,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:56,046 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-13 03:54:56,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:56,049 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-13 03:54:56,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:56,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:56,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 03:54:56,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 03:54:56,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 03:54:56,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:54:56,256 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 23 states. [2018-04-13 03:54:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:57,082 INFO L93 Difference]: Finished difference Result 470 states and 482 transitions. [2018-04-13 03:54:57,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 03:54:57,083 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2018-04-13 03:54:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:57,084 INFO L225 Difference]: With dead ends: 470 [2018-04-13 03:54:57,084 INFO L226 Difference]: Without dead ends: 470 [2018-04-13 03:54:57,084 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=1584, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 03:54:57,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-13 03:54:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 148. [2018-04-13 03:54:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 03:54:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-13 03:54:57,086 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-13 03:54:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:57,086 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-13 03:54:57,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 03:54:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-13 03:54:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 03:54:57,086 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:57,086 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:57,086 INFO L408 AbstractCegarLoop]: === Iteration 96 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:57,086 INFO L82 PathProgramCache]: Analyzing trace with hash -293734397, now seen corresponding path program 10 times [2018-04-13 03:54:57,086 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:57,086 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:57,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:57,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:57,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:57,095 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:57,099 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:57,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:57,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:57,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:54:57,124 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:54:57,124 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:57,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:57,131 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-13 03:54:57,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:57,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-13 03:54:57,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:57,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:57,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:57,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:57,146 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-13 03:54:57,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:57,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:57,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:57,151 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-13 03:54:57,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:57,154 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-13 03:54:57,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:54:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:57,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:57,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 03:54:57,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 03:54:57,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 03:54:57,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:54:57,330 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 22 states. [2018-04-13 03:54:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:58,100 INFO L93 Difference]: Finished difference Result 483 states and 496 transitions. [2018-04-13 03:54:58,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:54:58,100 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 74 [2018-04-13 03:54:58,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:58,101 INFO L225 Difference]: With dead ends: 483 [2018-04-13 03:54:58,101 INFO L226 Difference]: Without dead ends: 483 [2018-04-13 03:54:58,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=1436, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 03:54:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-13 03:54:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 149. [2018-04-13 03:54:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-13 03:54:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2018-04-13 03:54:58,103 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 74 [2018-04-13 03:54:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:58,103 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2018-04-13 03:54:58,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 03:54:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2018-04-13 03:54:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 03:54:58,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:58,104 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:58,104 INFO L408 AbstractCegarLoop]: === Iteration 97 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:58,104 INFO L82 PathProgramCache]: Analyzing trace with hash -275845027, now seen corresponding path program 11 times [2018-04-13 03:54:58,104 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:58,104 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:58,104 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:58,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:58,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:58,112 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:58,114 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:58,114 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:58,114 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:58,114 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:54:58,156 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 03:54:58,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:58,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:58,164 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-13 03:54:58,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:58,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:54:58,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:58,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:58,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:58,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:58,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:58,179 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 17 treesize of output 24 [2018-04-13 03:54:58,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:58,186 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-13 03:54:58,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:58,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:58,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:54:58,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:54:58,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:58,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:58,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 03:54:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:58,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:58,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 03:54:58,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 03:54:58,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 03:54:58,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:54:58,370 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand 20 states. [2018-04-13 03:54:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:59,026 INFO L93 Difference]: Finished difference Result 485 states and 499 transitions. [2018-04-13 03:54:59,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 03:54:59,026 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-04-13 03:54:59,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:59,027 INFO L225 Difference]: With dead ends: 485 [2018-04-13 03:54:59,027 INFO L226 Difference]: Without dead ends: 485 [2018-04-13 03:54:59,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=1153, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:54:59,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-04-13 03:54:59,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 153. [2018-04-13 03:54:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-13 03:54:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2018-04-13 03:54:59,029 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 74 [2018-04-13 03:54:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:59,029 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2018-04-13 03:54:59,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 03:54:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2018-04-13 03:54:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 03:54:59,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:59,030 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:59,030 INFO L408 AbstractCegarLoop]: === Iteration 98 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:54:59,030 INFO L82 PathProgramCache]: Analyzing trace with hash 759866056, now seen corresponding path program 11 times [2018-04-13 03:54:59,030 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:59,030 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:59,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:59,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:59,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:59,036 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:54:59,039 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:59,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:59,039 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:59,039 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:54:59,057 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 03:54:59,057 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:59,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:59,071 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-13 03:54:59,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:59,076 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-13 03:54:59,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:59,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:59,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:54:59,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:59,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:59,110 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-13 03:54:59,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:59,121 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-13 03:54:59,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:59,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:59,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:54:59,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:54:59,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:59,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:59,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 03:54:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:59,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:59,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 03:54:59,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 03:54:59,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 03:54:59,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1188, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:54:59,701 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand 36 states. [2018-04-13 03:55:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:01,528 INFO L93 Difference]: Finished difference Result 214 states and 227 transitions. [2018-04-13 03:55:01,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 03:55:01,528 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-04-13 03:55:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:01,529 INFO L225 Difference]: With dead ends: 214 [2018-04-13 03:55:01,529 INFO L226 Difference]: Without dead ends: 214 [2018-04-13 03:55:01,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=269, Invalid=4423, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 03:55:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-13 03:55:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 158. [2018-04-13 03:55:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 03:55:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-13 03:55:01,530 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-13 03:55:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:01,530 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-13 03:55:01,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 03:55:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-13 03:55:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 03:55:01,531 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:01,531 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:01,531 INFO L408 AbstractCegarLoop]: === Iteration 99 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:01,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1774361697, now seen corresponding path program 46 times [2018-04-13 03:55:01,531 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:01,531 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:01,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:01,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:01,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:01,537 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:01,540 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:01,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:01,540 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:01,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:55:01,561 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:55:01,561 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:01,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:01,567 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-13 03:55:01,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:01,571 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-13 03:55:01,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:01,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:01,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:01,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:01,583 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-13 03:55:01,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:01,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:01,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:01,589 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-13 03:55:01,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:01,592 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-13 03:55:01,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:02,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:02,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 03:55:02,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 03:55:02,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 03:55:02,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 03:55:02,244 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 35 states. [2018-04-13 03:55:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:03,636 INFO L93 Difference]: Finished difference Result 269 states and 282 transitions. [2018-04-13 03:55:03,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 03:55:03,636 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 79 [2018-04-13 03:55:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:03,637 INFO L225 Difference]: With dead ends: 269 [2018-04-13 03:55:03,637 INFO L226 Difference]: Without dead ends: 269 [2018-04-13 03:55:03,637 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 03:55:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-13 03:55:03,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 158. [2018-04-13 03:55:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 03:55:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-13 03:55:03,638 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-13 03:55:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:03,639 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-13 03:55:03,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 03:55:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-13 03:55:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 03:55:03,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:03,639 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:03,639 INFO L408 AbstractCegarLoop]: === Iteration 100 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:03,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1637699178, now seen corresponding path program 47 times [2018-04-13 03:55:03,639 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:03,639 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:03,640 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:03,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:03,640 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:03,645 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:03,649 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:03,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:03,649 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:03,649 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:55:03,671 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-04-13 03:55:03,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:03,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:03,677 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-13 03:55:03,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:03,680 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-13 03:55:03,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:03,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:03,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:03,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:03,692 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-13 03:55:03,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:03,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:03,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:03,700 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-13 03:55:03,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:03,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:03,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-13 03:55:04,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:55:04,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:04,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:04,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:58 [2018-04-13 03:55:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:04,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:04,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 03:55:04,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 03:55:04,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 03:55:04,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1185, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:55:04,601 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 36 states. [2018-04-13 03:55:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:07,048 INFO L93 Difference]: Finished difference Result 319 states and 332 transitions. [2018-04-13 03:55:07,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 03:55:07,048 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-04-13 03:55:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:07,049 INFO L225 Difference]: With dead ends: 319 [2018-04-13 03:55:07,049 INFO L226 Difference]: Without dead ends: 319 [2018-04-13 03:55:07,049 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=265, Invalid=4291, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 03:55:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-13 03:55:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 158. [2018-04-13 03:55:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 03:55:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-13 03:55:07,051 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-13 03:55:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:07,051 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-13 03:55:07,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 03:55:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-13 03:55:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 03:55:07,051 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:07,051 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:07,051 INFO L408 AbstractCegarLoop]: === Iteration 101 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:07,051 INFO L82 PathProgramCache]: Analyzing trace with hash -799294783, now seen corresponding path program 48 times [2018-04-13 03:55:07,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:07,051 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:07,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:07,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:07,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:07,058 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:07,061 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:07,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:07,061 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:07,061 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:55:07,084 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-04-13 03:55:07,084 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:07,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:07,091 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-13 03:55:07,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:07,094 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-13 03:55:07,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:07,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:07,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:07,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:07,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:07,106 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-13 03:55:07,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:07,111 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-13 03:55:07,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:07,114 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-13 03:55:07,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:07,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-13 03:55:07,172 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 5 treesize of output 1 [2018-04-13 03:55:07,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:07,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:07,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 03:55:07,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:21 [2018-04-13 03:55:07,247 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 11 treesize of output 1 [2018-04-13 03:55:07,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:07,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:07,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-13 03:55:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:07,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:07,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 03:55:07,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 03:55:07,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 03:55:07,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=989, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:55:07,520 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 33 states. [2018-04-13 03:55:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:08,750 INFO L93 Difference]: Finished difference Result 364 states and 377 transitions. [2018-04-13 03:55:08,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 03:55:08,751 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 79 [2018-04-13 03:55:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:08,751 INFO L225 Difference]: With dead ends: 364 [2018-04-13 03:55:08,751 INFO L226 Difference]: Without dead ends: 364 [2018-04-13 03:55:08,752 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=3430, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 03:55:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-04-13 03:55:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 158. [2018-04-13 03:55:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 03:55:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-13 03:55:08,753 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-13 03:55:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:08,753 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-13 03:55:08,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 03:55:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-13 03:55:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 03:55:08,754 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:08,754 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:08,754 INFO L408 AbstractCegarLoop]: === Iteration 102 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:08,754 INFO L82 PathProgramCache]: Analyzing trace with hash 10662922, now seen corresponding path program 49 times [2018-04-13 03:55:08,754 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:08,754 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:08,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:08,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:08,755 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:08,761 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:08,763 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:08,763 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:08,763 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:08,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:55:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:08,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:08,796 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-13 03:55:08,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:08,800 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-13 03:55:08,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:08,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:08,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:08,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:08,812 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-13 03:55:08,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:08,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:08,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:08,819 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-13 03:55:08,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:08,822 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-13 03:55:08,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:09,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:09,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 03:55:09,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 03:55:09,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 03:55:09,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:55:09,188 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 31 states. [2018-04-13 03:55:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:10,362 INFO L93 Difference]: Finished difference Result 404 states and 417 transitions. [2018-04-13 03:55:10,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 03:55:10,362 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 79 [2018-04-13 03:55:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:10,364 INFO L225 Difference]: With dead ends: 404 [2018-04-13 03:55:10,364 INFO L226 Difference]: Without dead ends: 404 [2018-04-13 03:55:10,364 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=3201, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 03:55:10,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-04-13 03:55:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 158. [2018-04-13 03:55:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 03:55:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-13 03:55:10,367 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-13 03:55:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:10,367 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-13 03:55:10,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 03:55:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-13 03:55:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 03:55:10,367 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:10,368 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:10,368 INFO L408 AbstractCegarLoop]: === Iteration 103 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:10,368 INFO L82 PathProgramCache]: Analyzing trace with hash -72003295, now seen corresponding path program 50 times [2018-04-13 03:55:10,368 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:10,368 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:10,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:10,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:55:10,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:10,375 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:10,378 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:10,378 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:10,378 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:10,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:55:10,398 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:55:10,398 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:10,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:10,403 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-13 03:55:10,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:10,406 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-13 03:55:10,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:10,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:10,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:10,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:10,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:10,418 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-13 03:55:10,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:10,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, 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-13 03:55:10,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:10,426 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-13 03:55:10,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:10,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:10,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 03:55:10,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 03:55:10,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 03:55:10,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:55:10,887 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 29 states. [2018-04-13 03:55:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:12,284 INFO L93 Difference]: Finished difference Result 439 states and 452 transitions. [2018-04-13 03:55:12,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 03:55:12,284 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-04-13 03:55:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:12,285 INFO L225 Difference]: With dead ends: 439 [2018-04-13 03:55:12,285 INFO L226 Difference]: Without dead ends: 439 [2018-04-13 03:55:12,285 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=2668, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 03:55:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-13 03:55:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 158. [2018-04-13 03:55:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 03:55:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-13 03:55:12,287 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-13 03:55:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:12,287 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-13 03:55:12,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 03:55:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-13 03:55:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 03:55:12,288 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:12,288 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:12,288 INFO L408 AbstractCegarLoop]: === Iteration 104 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:12,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1837325910, now seen corresponding path program 51 times [2018-04-13 03:55:12,288 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:12,288 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:12,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:12,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:12,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:12,300 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:12,303 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:12,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:12,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:12,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:55:12,387 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-04-13 03:55:12,387 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:12,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:12,419 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-13 03:55:12,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:12,423 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-13 03:55:12,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:12,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:12,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:12,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:12,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:12,437 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-13 03:55:12,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:12,442 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-13 03:55:12,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:12,446 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-13 03:55:12,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:12,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:12,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 03:55:12,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:55:12,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:55:12,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:55:12,747 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 28 states. [2018-04-13 03:55:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:13,731 INFO L93 Difference]: Finished difference Result 469 states and 482 transitions. [2018-04-13 03:55:13,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:55:13,732 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-04-13 03:55:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:13,732 INFO L225 Difference]: With dead ends: 469 [2018-04-13 03:55:13,732 INFO L226 Difference]: Without dead ends: 469 [2018-04-13 03:55:13,733 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=2468, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 03:55:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-04-13 03:55:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 158. [2018-04-13 03:55:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 03:55:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-13 03:55:13,734 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-13 03:55:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:13,734 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-13 03:55:13,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:55:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-13 03:55:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 03:55:13,735 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:13,735 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:13,735 INFO L408 AbstractCegarLoop]: === Iteration 105 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:13,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1401249665, now seen corresponding path program 52 times [2018-04-13 03:55:13,735 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:13,735 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:13,735 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:13,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:13,736 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:13,742 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:13,744 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:13,744 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:13,744 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:13,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:55:13,764 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:55:13,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:13,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:13,770 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-13 03:55:13,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:13,773 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-13 03:55:13,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:13,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:13,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:13,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:13,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:13,784 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-13 03:55:13,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:13,788 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-13 03:55:13,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:13,791 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-13 03:55:13,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:14,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:14,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 03:55:14,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:55:14,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:55:14,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:55:14,062 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 28 states. [2018-04-13 03:55:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:15,059 INFO L93 Difference]: Finished difference Result 494 states and 507 transitions. [2018-04-13 03:55:15,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:55:15,059 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-04-13 03:55:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:15,060 INFO L225 Difference]: With dead ends: 494 [2018-04-13 03:55:15,060 INFO L226 Difference]: Without dead ends: 494 [2018-04-13 03:55:15,060 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=2467, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 03:55:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-04-13 03:55:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 158. [2018-04-13 03:55:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 03:55:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-13 03:55:15,062 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-13 03:55:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:15,062 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-13 03:55:15,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:55:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-13 03:55:15,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 03:55:15,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:15,062 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:15,062 INFO L408 AbstractCegarLoop]: === Iteration 106 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:15,062 INFO L82 PathProgramCache]: Analyzing trace with hash 901060426, now seen corresponding path program 53 times [2018-04-13 03:55:15,062 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:15,062 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:15,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:15,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:15,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:15,070 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:15,072 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:15,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:15,072 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:15,072 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:55:15,094 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-04-13 03:55:15,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:15,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:15,103 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-13 03:55:15,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:15,107 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-13 03:55:15,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:15,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:15,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:15,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:15,122 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-13 03:55:15,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:15,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:15,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:15,131 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-13 03:55:15,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:15,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:55:15,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:55:15,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 03:55:15,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:15,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:15,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2018-04-13 03:55:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:15,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:15,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 03:55:15,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:55:15,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:55:15,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=700, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:55:15,514 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 28 states. [2018-04-13 03:55:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:16,880 INFO L93 Difference]: Finished difference Result 514 states and 527 transitions. [2018-04-13 03:55:16,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:55:16,881 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-04-13 03:55:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:16,881 INFO L225 Difference]: With dead ends: 514 [2018-04-13 03:55:16,881 INFO L226 Difference]: Without dead ends: 514 [2018-04-13 03:55:16,881 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=2474, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 03:55:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-04-13 03:55:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 158. [2018-04-13 03:55:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 03:55:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-13 03:55:16,883 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-13 03:55:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:16,883 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-13 03:55:16,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:55:16,883 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-13 03:55:16,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 03:55:16,883 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:16,883 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:16,883 INFO L408 AbstractCegarLoop]: === Iteration 107 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:16,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1258415585, now seen corresponding path program 54 times [2018-04-13 03:55:16,883 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:16,883 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:16,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:16,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:16,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:16,891 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:16,893 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:16,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:16,893 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:16,893 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:55:16,949 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-04-13 03:55:16,949 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:16,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:16,958 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-13 03:55:16,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:16,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:55:16,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:16,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:16,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:16,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:16,975 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-13 03:55:16,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:16,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:16,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:16,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 03:55:16,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:16,992 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-13 03:55:16,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:17,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:17,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 03:55:17,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 03:55:17,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 03:55:17,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:55:17,250 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 25 states. [2018-04-13 03:55:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:18,243 INFO L93 Difference]: Finished difference Result 529 states and 542 transitions. [2018-04-13 03:55:18,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 03:55:18,243 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-04-13 03:55:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:18,244 INFO L225 Difference]: With dead ends: 529 [2018-04-13 03:55:18,244 INFO L226 Difference]: Without dead ends: 529 [2018-04-13 03:55:18,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=1916, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 03:55:18,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-04-13 03:55:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 158. [2018-04-13 03:55:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 03:55:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-13 03:55:18,245 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-13 03:55:18,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:18,245 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-13 03:55:18,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 03:55:18,245 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-13 03:55:18,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 03:55:18,246 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:18,246 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:18,246 INFO L408 AbstractCegarLoop]: === Iteration 108 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:18,246 INFO L82 PathProgramCache]: Analyzing trace with hash -849996566, now seen corresponding path program 55 times [2018-04-13 03:55:18,246 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:18,246 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:18,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:18,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:18,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:18,254 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:18,255 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:18,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:18,255 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:18,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:55:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:18,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:18,289 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-13 03:55:18,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:18,294 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-13 03:55:18,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:18,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:18,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:18,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:18,311 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-13 03:55:18,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:18,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:18,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:18,317 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-13 03:55:18,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:18,320 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-13 03:55:18,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:18,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:18,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 03:55:18,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 03:55:18,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 03:55:18,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:55:18,540 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 24 states. [2018-04-13 03:55:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:19,456 INFO L93 Difference]: Finished difference Result 540 states and 553 transitions. [2018-04-13 03:55:19,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 03:55:19,456 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 79 [2018-04-13 03:55:19,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:19,457 INFO L225 Difference]: With dead ends: 540 [2018-04-13 03:55:19,457 INFO L226 Difference]: Without dead ends: 540 [2018-04-13 03:55:19,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=1752, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 03:55:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-04-13 03:55:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 158. [2018-04-13 03:55:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 03:55:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-13 03:55:19,459 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-13 03:55:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:19,459 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-13 03:55:19,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 03:55:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-13 03:55:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 03:55:19,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:19,460 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:19,460 INFO L408 AbstractCegarLoop]: === Iteration 109 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1059003327, now seen corresponding path program 11 times [2018-04-13 03:55:19,460 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:19,460 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:19,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:19,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:55:19,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:19,469 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:19,474 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:19,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:19,474 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:19,474 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:55:19,516 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 03:55:19,516 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:19,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:19,523 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-13 03:55:19,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:19,536 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-13 03:55:19,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:19,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:19,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:19,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:19,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:19,560 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 17 treesize of output 24 [2018-04-13 03:55:19,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:19,566 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-13 03:55:19,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:19,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:55:19,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:55:19,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:55:19,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:19,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:19,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 03:55:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:19,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:19,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 03:55:19,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 03:55:19,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 03:55:19,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:55:19,875 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 24 states. [2018-04-13 03:55:20,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:20,901 INFO L93 Difference]: Finished difference Result 553 states and 567 transitions. [2018-04-13 03:55:20,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 03:55:20,901 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 79 [2018-04-13 03:55:20,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:20,902 INFO L225 Difference]: With dead ends: 553 [2018-04-13 03:55:20,902 INFO L226 Difference]: Without dead ends: 553 [2018-04-13 03:55:20,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=1836, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 03:55:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-04-13 03:55:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 159. [2018-04-13 03:55:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-13 03:55:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2018-04-13 03:55:20,904 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 79 [2018-04-13 03:55:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:20,904 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2018-04-13 03:55:20,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 03:55:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2018-04-13 03:55:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 03:55:20,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:20,904 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:20,904 INFO L408 AbstractCegarLoop]: === Iteration 110 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:20,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1041113957, now seen corresponding path program 12 times [2018-04-13 03:55:20,904 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:20,904 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:20,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:20,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:20,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:20,913 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:20,914 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:20,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:20,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:20,915 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:55:20,981 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-13 03:55:20,982 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:20,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:20,991 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-13 03:55:20,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:20,994 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-13 03:55:20,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:20,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:20,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:21,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:21,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:21,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 03:55:21,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:21,010 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-13 03:55:21,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:21,013 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-13 03:55:21,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:21,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:21,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 03:55:21,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:55:21,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:55:21,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:55:21,173 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand 21 states. [2018-04-13 03:55:21,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:21,823 INFO L93 Difference]: Finished difference Result 555 states and 570 transitions. [2018-04-13 03:55:21,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 03:55:21,824 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2018-04-13 03:55:21,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:21,824 INFO L225 Difference]: With dead ends: 555 [2018-04-13 03:55:21,824 INFO L226 Difference]: Without dead ends: 555 [2018-04-13 03:55:21,825 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=1294, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:55:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-04-13 03:55:21,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 163. [2018-04-13 03:55:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-13 03:55:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2018-04-13 03:55:21,826 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 79 [2018-04-13 03:55:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:21,826 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2018-04-13 03:55:21,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:55:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2018-04-13 03:55:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:21,827 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:21,827 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:21,827 INFO L408 AbstractCegarLoop]: === Iteration 111 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1443781957, now seen corresponding path program 12 times [2018-04-13 03:55:21,827 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:21,827 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:21,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:21,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:21,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:21,833 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:21,836 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:21,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:21,837 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:21,837 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:55:21,867 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-13 03:55:21,867 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:21,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:21,876 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-13 03:55:21,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:21,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:21,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 03:55:21,900 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 03:55:21,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 03:55:21,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 03:55:21,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:24 [2018-04-13 03:55:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:22,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:22,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 03:55:22,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 03:55:22,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 03:55:22,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:55:22,717 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand 38 states. [2018-04-13 03:55:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:25,501 INFO L93 Difference]: Finished difference Result 234 states and 248 transitions. [2018-04-13 03:55:25,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 03:55:25,501 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 84 [2018-04-13 03:55:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:25,501 INFO L225 Difference]: With dead ends: 234 [2018-04-13 03:55:25,502 INFO L226 Difference]: Without dead ends: 234 [2018-04-13 03:55:25,502 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=284, Invalid=4972, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 03:55:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-04-13 03:55:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 168. [2018-04-13 03:55:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:55:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-13 03:55:25,503 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-13 03:55:25,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:25,503 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-13 03:55:25,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 03:55:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-13 03:55:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:25,504 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:25,504 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:25,504 INFO L408 AbstractCegarLoop]: === Iteration 112 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:25,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2012151677, now seen corresponding path program 5 times [2018-04-13 03:55:25,504 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:25,504 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:25,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:25,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:25,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:25,510 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:25,513 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:25,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:25,513 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:25,513 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:55:25,529 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-04-13 03:55:25,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:25,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:25,534 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-13 03:55:25,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:25,541 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-13 03:55:25,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:25,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:25,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:25,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:25,552 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-13 03:55:25,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:25,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:25,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:25,560 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 17 treesize of output 24 [2018-04-13 03:55:25,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:25,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:55:25,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:55:25,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 03:55:25,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:25,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:25,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:11 [2018-04-13 03:55:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:26,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:26,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 03:55:26,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 03:55:26,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 03:55:26,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1330, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:55:26,150 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 38 states. [2018-04-13 03:55:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:28,054 INFO L93 Difference]: Finished difference Result 293 states and 307 transitions. [2018-04-13 03:55:28,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 03:55:28,054 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 84 [2018-04-13 03:55:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:28,054 INFO L225 Difference]: With dead ends: 293 [2018-04-13 03:55:28,055 INFO L226 Difference]: Without dead ends: 293 [2018-04-13 03:55:28,055 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=285, Invalid=4971, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 03:55:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-13 03:55:28,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 168. [2018-04-13 03:55:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:55:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-13 03:55:28,056 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-13 03:55:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:28,056 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-13 03:55:28,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 03:55:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-13 03:55:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:28,057 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:28,057 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:28,057 INFO L408 AbstractCegarLoop]: === Iteration 113 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:28,057 INFO L82 PathProgramCache]: Analyzing trace with hash 935295820, now seen corresponding path program 56 times [2018-04-13 03:55:28,057 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:28,057 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:28,057 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:28,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:28,058 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:28,063 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:28,067 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:28,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:28,068 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:28,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:55:28,082 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:55:28,082 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:28,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:28,088 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-13 03:55:28,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:28,091 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-13 03:55:28,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:28,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:28,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:28,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:28,102 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-13 03:55:28,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:28,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:28,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:28,108 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-13 03:55:28,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:28,111 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-13 03:55:28,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:28,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:28,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 03:55:28,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 03:55:28,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 03:55:28,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:55:28,997 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 36 states. [2018-04-13 03:55:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:31,007 INFO L93 Difference]: Finished difference Result 289 states and 303 transitions. [2018-04-13 03:55:31,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 03:55:31,007 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 84 [2018-04-13 03:55:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:31,008 INFO L225 Difference]: With dead ends: 289 [2018-04-13 03:55:31,008 INFO L226 Difference]: Without dead ends: 289 [2018-04-13 03:55:31,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=258, Invalid=4298, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 03:55:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-04-13 03:55:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 168. [2018-04-13 03:55:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:55:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-13 03:55:31,009 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-13 03:55:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:31,009 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-13 03:55:31,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 03:55:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-13 03:55:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:31,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:31,010 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:31,010 INFO L408 AbstractCegarLoop]: === Iteration 114 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:31,010 INFO L82 PathProgramCache]: Analyzing trace with hash -434133277, now seen corresponding path program 57 times [2018-04-13 03:55:31,010 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:31,010 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:31,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:31,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:31,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:31,016 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:31,033 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:31,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:31,033 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:31,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:55:31,062 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-04-13 03:55:31,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:31,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:31,070 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-13 03:55:31,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:31,073 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-13 03:55:31,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:31,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:31,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:31,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:31,085 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-13 03:55:31,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:31,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:31,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:31,091 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-13 03:55:31,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:31,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-13 03:55:31,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:31,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:31,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 03:55:31,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 03:55:31,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 03:55:31,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:55:31,493 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 34 states. [2018-04-13 03:55:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:32,630 INFO L93 Difference]: Finished difference Result 344 states and 358 transitions. [2018-04-13 03:55:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:55:32,630 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 84 [2018-04-13 03:55:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:32,630 INFO L225 Difference]: With dead ends: 344 [2018-04-13 03:55:32,631 INFO L226 Difference]: Without dead ends: 344 [2018-04-13 03:55:32,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=3792, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 03:55:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-13 03:55:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 168. [2018-04-13 03:55:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:55:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-13 03:55:32,632 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-13 03:55:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:32,632 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-13 03:55:32,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 03:55:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-13 03:55:32,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:32,632 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:32,632 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:32,633 INFO L408 AbstractCegarLoop]: === Iteration 115 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:32,633 INFO L82 PathProgramCache]: Analyzing trace with hash -570795796, now seen corresponding path program 58 times [2018-04-13 03:55:32,633 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:32,633 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:32,633 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:32,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:32,633 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:32,639 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:32,643 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:32,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:32,643 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:32,644 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:55:32,665 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:55:32,665 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:32,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:32,669 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-13 03:55:32,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:32,673 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-13 03:55:32,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:32,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:32,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:32,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:32,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:32,684 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-13 03:55:32,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:32,689 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-13 03:55:32,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:32,692 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-13 03:55:32,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:33,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:33,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 03:55:33,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 03:55:33,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 03:55:33,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:55:33,049 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 33 states. [2018-04-13 03:55:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:34,180 INFO L93 Difference]: Finished difference Result 394 states and 408 transitions. [2018-04-13 03:55:34,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 03:55:34,181 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 84 [2018-04-13 03:55:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:34,181 INFO L225 Difference]: With dead ends: 394 [2018-04-13 03:55:34,181 INFO L226 Difference]: Without dead ends: 394 [2018-04-13 03:55:34,181 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=230, Invalid=3552, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 03:55:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-13 03:55:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 168. [2018-04-13 03:55:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:55:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-13 03:55:34,183 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-13 03:55:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:34,183 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-13 03:55:34,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 03:55:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-13 03:55:34,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:34,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:34,183 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:34,183 INFO L408 AbstractCegarLoop]: === Iteration 116 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:34,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1287177539, now seen corresponding path program 59 times [2018-04-13 03:55:34,183 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:34,183 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:34,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:34,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:34,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:34,190 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:34,192 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:34,192 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:34,192 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:34,192 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:55:34,241 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-04-13 03:55:34,241 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:34,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:34,248 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-13 03:55:34,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:34,255 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-13 03:55:34,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:34,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:34,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:34,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:34,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:34,266 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-13 03:55:34,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:34,270 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-13 03:55:34,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:34,273 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-13 03:55:34,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:34,393 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 5 treesize of output 1 [2018-04-13 03:55:34,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:34,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:34,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-04-13 03:55:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:34,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:34,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 03:55:34,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 03:55:34,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 03:55:34,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:55:34,709 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 34 states. [2018-04-13 03:55:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:36,076 INFO L93 Difference]: Finished difference Result 439 states and 453 transitions. [2018-04-13 03:55:36,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 03:55:36,093 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 84 [2018-04-13 03:55:36,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:36,093 INFO L225 Difference]: With dead ends: 439 [2018-04-13 03:55:36,093 INFO L226 Difference]: Without dead ends: 439 [2018-04-13 03:55:36,094 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=3916, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 03:55:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-13 03:55:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 168. [2018-04-13 03:55:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:55:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-13 03:55:36,095 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-13 03:55:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:36,095 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-13 03:55:36,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 03:55:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-13 03:55:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:36,095 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:36,095 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:36,095 INFO L408 AbstractCegarLoop]: === Iteration 117 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2097135244, now seen corresponding path program 60 times [2018-04-13 03:55:36,096 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:36,096 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:36,096 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:36,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:36,096 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:36,102 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:36,104 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:36,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:36,104 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:36,104 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:55:36,150 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-04-13 03:55:36,151 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:36,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:36,159 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-13 03:55:36,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:36,163 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-13 03:55:36,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:36,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:36,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:36,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:36,179 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-13 03:55:36,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:36,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:36,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:36,186 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-13 03:55:36,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:36,197 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-13 03:55:36,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:36,548 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:36,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 03:55:36,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 03:55:36,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 03:55:36,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:55:36,549 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 31 states. [2018-04-13 03:55:37,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:37,737 INFO L93 Difference]: Finished difference Result 479 states and 493 transitions. [2018-04-13 03:55:37,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 03:55:37,737 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2018-04-13 03:55:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:37,738 INFO L225 Difference]: With dead ends: 479 [2018-04-13 03:55:37,738 INFO L226 Difference]: Without dead ends: 479 [2018-04-13 03:55:37,738 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=3096, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 03:55:37,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-04-13 03:55:37,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 168. [2018-04-13 03:55:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:55:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-13 03:55:37,739 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-13 03:55:37,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:37,739 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-13 03:55:37,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 03:55:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-13 03:55:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:37,740 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:37,740 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:37,740 INFO L408 AbstractCegarLoop]: === Iteration 118 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:37,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2014469027, now seen corresponding path program 61 times [2018-04-13 03:55:37,740 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:37,740 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:37,740 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:37,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:37,740 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:37,747 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:37,749 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:37,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:37,749 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:37,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:55:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:37,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:37,782 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-13 03:55:37,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:37,786 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-13 03:55:37,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:37,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:37,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:37,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:37,797 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-13 03:55:37,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:37,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:37,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:37,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 03:55:37,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:37,826 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-13 03:55:37,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:38,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:38,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 03:55:38,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 03:55:38,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 03:55:38,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:55:38,155 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 31 states. [2018-04-13 03:55:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:39,337 INFO L93 Difference]: Finished difference Result 514 states and 528 transitions. [2018-04-13 03:55:39,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 03:55:39,337 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2018-04-13 03:55:39,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:39,338 INFO L225 Difference]: With dead ends: 514 [2018-04-13 03:55:39,338 INFO L226 Difference]: Without dead ends: 514 [2018-04-13 03:55:39,338 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=3095, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 03:55:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-04-13 03:55:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 168. [2018-04-13 03:55:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:55:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-13 03:55:39,340 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-13 03:55:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:39,340 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-13 03:55:39,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 03:55:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-13 03:55:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:39,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:39,340 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:39,340 INFO L408 AbstractCegarLoop]: === Iteration 119 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:39,341 INFO L82 PathProgramCache]: Analyzing trace with hash 249146412, now seen corresponding path program 62 times [2018-04-13 03:55:39,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:39,341 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:39,341 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:39,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:55:39,341 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:39,348 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:39,351 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:39,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:39,351 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:39,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:55:39,367 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:55:39,367 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:39,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:39,373 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-13 03:55:39,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:39,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:55:39,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:39,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:39,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:39,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:39,387 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-13 03:55:39,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:39,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:39,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:39,394 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-13 03:55:39,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:39,397 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-13 03:55:39,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:39,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:39,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 03:55:39,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 03:55:39,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 03:55:39,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:55:39,894 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 31 states. [2018-04-13 03:55:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:41,409 INFO L93 Difference]: Finished difference Result 544 states and 558 transitions. [2018-04-13 03:55:41,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 03:55:41,434 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2018-04-13 03:55:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:41,435 INFO L225 Difference]: With dead ends: 544 [2018-04-13 03:55:41,435 INFO L226 Difference]: Without dead ends: 544 [2018-04-13 03:55:41,435 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=3211, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 03:55:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-04-13 03:55:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 168. [2018-04-13 03:55:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:55:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-13 03:55:41,436 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-13 03:55:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:41,436 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-13 03:55:41,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 03:55:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-13 03:55:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:41,437 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:41,437 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:41,437 INFO L408 AbstractCegarLoop]: === Iteration 120 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash -807245309, now seen corresponding path program 63 times [2018-04-13 03:55:41,437 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:41,437 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:41,437 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:41,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:41,437 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:41,444 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:41,446 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:41,446 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:41,446 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:41,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:55:41,498 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-04-13 03:55:41,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:41,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:41,506 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-13 03:55:41,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:41,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 6 treesize of output 5 [2018-04-13 03:55:41,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:41,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:41,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:41,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:41,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:41,521 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-13 03:55:41,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:41,525 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-13 03:55:41,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:41,528 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-13 03:55:41,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:41,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:41,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 03:55:41,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:55:41,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:55:41,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:55:41,797 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 28 states. [2018-04-13 03:55:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:42,794 INFO L93 Difference]: Finished difference Result 569 states and 583 transitions. [2018-04-13 03:55:42,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:55:42,794 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 84 [2018-04-13 03:55:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:42,795 INFO L225 Difference]: With dead ends: 569 [2018-04-13 03:55:42,795 INFO L226 Difference]: Without dead ends: 569 [2018-04-13 03:55:42,795 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=2472, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 03:55:42,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-04-13 03:55:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 168. [2018-04-13 03:55:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:55:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-13 03:55:42,797 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-13 03:55:42,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:42,797 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-13 03:55:42,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:55:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-13 03:55:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:42,798 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:42,798 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:42,798 INFO L408 AbstractCegarLoop]: === Iteration 121 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:42,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1307434548, now seen corresponding path program 64 times [2018-04-13 03:55:42,798 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:42,799 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:42,799 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:42,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:42,799 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:42,812 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:42,814 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:42,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:42,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:42,815 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:55:42,856 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:55:42,856 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:42,865 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:42,869 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-13 03:55:42,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:42,873 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-13 03:55:42,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:42,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:42,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:42,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:42,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:42,885 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-13 03:55:42,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:42,890 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-13 03:55:42,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:42,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-13 03:55:42,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:43,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:43,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 03:55:43,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 03:55:43,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 03:55:43,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:55:43,209 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 27 states. [2018-04-13 03:55:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:44,353 INFO L93 Difference]: Finished difference Result 589 states and 603 transitions. [2018-04-13 03:55:44,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 03:55:44,354 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-04-13 03:55:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:44,354 INFO L225 Difference]: With dead ends: 589 [2018-04-13 03:55:44,354 INFO L226 Difference]: Without dead ends: 589 [2018-04-13 03:55:44,354 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=2280, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 03:55:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-04-13 03:55:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 168. [2018-04-13 03:55:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:55:44,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-13 03:55:44,356 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-13 03:55:44,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:44,356 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-13 03:55:44,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 03:55:44,356 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-13 03:55:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:44,357 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:44,357 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:44,357 INFO L408 AbstractCegarLoop]: === Iteration 122 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:44,357 INFO L82 PathProgramCache]: Analyzing trace with hash -950079389, now seen corresponding path program 65 times [2018-04-13 03:55:44,357 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:44,357 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:44,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:44,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:44,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:44,365 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:44,367 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:44,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:44,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:44,368 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:55:44,414 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-04-13 03:55:44,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:44,421 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:44,423 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-13 03:55:44,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:44,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 6 treesize of output 5 [2018-04-13 03:55:44,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:44,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:44,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:44,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:44,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:44,437 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-13 03:55:44,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:44,444 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-13 03:55:44,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:44,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:44,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-13 03:55:44,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:55:44,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:44,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:44,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:14 [2018-04-13 03:55:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:44,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:44,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 03:55:44,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 03:55:44,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 03:55:44,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:55:44,816 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 29 states. [2018-04-13 03:55:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:46,169 INFO L93 Difference]: Finished difference Result 604 states and 618 transitions. [2018-04-13 03:55:46,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 03:55:46,169 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 84 [2018-04-13 03:55:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:46,170 INFO L225 Difference]: With dead ends: 604 [2018-04-13 03:55:46,170 INFO L226 Difference]: Without dead ends: 604 [2018-04-13 03:55:46,171 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=198, Invalid=2882, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 03:55:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-04-13 03:55:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 168. [2018-04-13 03:55:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:55:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-13 03:55:46,190 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-13 03:55:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:46,190 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-13 03:55:46,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 03:55:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-13 03:55:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:46,191 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:46,191 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:46,191 INFO L408 AbstractCegarLoop]: === Iteration 123 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:46,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1236475756, now seen corresponding path program 66 times [2018-04-13 03:55:46,191 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:46,191 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:46,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:46,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:46,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:46,207 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:46,210 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:46,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:46,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:46,211 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:55:46,320 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-04-13 03:55:46,320 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:46,329 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:46,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-13 03:55:46,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:46,335 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-13 03:55:46,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:46,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:46,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:46,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:46,349 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-13 03:55:46,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:46,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:46,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:46,356 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-13 03:55:46,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:46,360 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-13 03:55:46,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:46,452 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 5 treesize of output 1 [2018-04-13 03:55:46,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:46,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:46,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-04-13 03:55:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:46,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:46,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 03:55:46,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 03:55:46,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 03:55:46,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:55:46,664 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 26 states. [2018-04-13 03:55:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:47,658 INFO L93 Difference]: Finished difference Result 615 states and 629 transitions. [2018-04-13 03:55:47,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 03:55:47,658 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-04-13 03:55:47,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:47,659 INFO L225 Difference]: With dead ends: 615 [2018-04-13 03:55:47,659 INFO L226 Difference]: Without dead ends: 615 [2018-04-13 03:55:47,659 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=2101, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 03:55:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-04-13 03:55:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 168. [2018-04-13 03:55:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 03:55:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-13 03:55:47,660 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-13 03:55:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:47,660 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-13 03:55:47,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 03:55:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-13 03:55:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:47,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:47,661 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:47,661 INFO L408 AbstractCegarLoop]: === Iteration 124 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:47,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1027468995, now seen corresponding path program 12 times [2018-04-13 03:55:47,661 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:47,661 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:47,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:47,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:47,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:47,670 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:47,673 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:47,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:47,673 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:47,673 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:55:47,770 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-13 03:55:47,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:47,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:47,785 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-13 03:55:47,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:47,789 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-13 03:55:47,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:47,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:47,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:47,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:47,803 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-13 03:55:47,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:47,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:47,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:47,810 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-13 03:55:47,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:47,814 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-13 03:55:47,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:48,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:48,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 03:55:48,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 03:55:48,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 03:55:48,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:55:48,046 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 24 states. [2018-04-13 03:55:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:48,961 INFO L93 Difference]: Finished difference Result 628 states and 643 transitions. [2018-04-13 03:55:48,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 03:55:48,961 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 84 [2018-04-13 03:55:48,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:48,962 INFO L225 Difference]: With dead ends: 628 [2018-04-13 03:55:48,962 INFO L226 Difference]: Without dead ends: 628 [2018-04-13 03:55:48,962 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=1756, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 03:55:48,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-04-13 03:55:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 169. [2018-04-13 03:55:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-13 03:55:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 184 transitions. [2018-04-13 03:55:48,963 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 184 transitions. Word has length 84 [2018-04-13 03:55:48,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:48,963 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 184 transitions. [2018-04-13 03:55:48,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 03:55:48,963 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 184 transitions. [2018-04-13 03:55:48,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:55:48,964 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:48,964 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:48,964 INFO L408 AbstractCegarLoop]: === Iteration 125 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:48,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1045358365, now seen corresponding path program 13 times [2018-04-13 03:55:48,964 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:48,964 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:48,964 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:48,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:48,965 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:48,973 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:48,975 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:48,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:48,975 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:48,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:55:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:49,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:49,012 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-13 03:55:49,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:49,016 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-13 03:55:49,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:49,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:49,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:49,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:49,036 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-13 03:55:49,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:49,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:49,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:49,042 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-13 03:55:49,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:49,045 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-13 03:55:49,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:49,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:49,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 03:55:49,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 03:55:49,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 03:55:49,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:55:49,217 INFO L87 Difference]: Start difference. First operand 169 states and 184 transitions. Second operand 22 states. [2018-04-13 03:55:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:50,000 INFO L93 Difference]: Finished difference Result 630 states and 646 transitions. [2018-04-13 03:55:50,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:55:50,000 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2018-04-13 03:55:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:50,001 INFO L225 Difference]: With dead ends: 630 [2018-04-13 03:55:50,001 INFO L226 Difference]: Without dead ends: 630 [2018-04-13 03:55:50,001 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 03:55:50,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-04-13 03:55:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 173. [2018-04-13 03:55:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-13 03:55:50,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 188 transitions. [2018-04-13 03:55:50,002 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 188 transitions. Word has length 84 [2018-04-13 03:55:50,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:50,002 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 188 transitions. [2018-04-13 03:55:50,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 03:55:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 188 transitions. [2018-04-13 03:55:50,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:55:50,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:50,003 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:50,003 INFO L408 AbstractCegarLoop]: === Iteration 126 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:50,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1776068840, now seen corresponding path program 13 times [2018-04-13 03:55:50,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:50,003 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:50,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:50,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:55:50,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:50,009 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:50,013 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:50,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:50,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:50,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:55:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:50,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:50,032 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-13 03:55:50,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:50,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:50,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 03:55:50,054 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 03:55:50,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 03:55:50,062 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 2 xjuncts. [2018-04-13 03:55:50,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-04-13 03:55:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:51,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:51,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-13 03:55:51,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-13 03:55:51,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-13 03:55:51,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1637, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 03:55:51,120 INFO L87 Difference]: Start difference. First operand 173 states and 188 transitions. Second operand 42 states. [2018-04-13 03:55:54,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:54,638 INFO L93 Difference]: Finished difference Result 249 states and 264 transitions. [2018-04-13 03:55:54,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 03:55:54,638 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 89 [2018-04-13 03:55:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:54,639 INFO L225 Difference]: With dead ends: 249 [2018-04-13 03:55:54,639 INFO L226 Difference]: Without dead ends: 249 [2018-04-13 03:55:54,639 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=314, Invalid=6006, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 03:55:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-13 03:55:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 178. [2018-04-13 03:55:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:55:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:55:54,640 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:55:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:54,640 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:55:54,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-13 03:55:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:55:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:55:54,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:54,640 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:54,640 INFO L408 AbstractCegarLoop]: === Iteration 127 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:54,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1194042262, now seen corresponding path program 6 times [2018-04-13 03:55:54,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:54,641 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:54,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:54,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:55:54,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:54,647 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:54,650 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:54,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:54,650 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:54,651 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:55:54,685 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-04-13 03:55:54,686 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:55:54,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:54,692 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-13 03:55:54,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:54,695 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-13 03:55:54,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:54,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:54,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:54,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:54,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:54,706 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-13 03:55:54,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:54,711 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-13 03:55:54,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:54,714 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-13 03:55:54,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:55,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:55,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-13 03:55:55,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 03:55:55,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 03:55:55,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:55:55,258 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 39 states. [2018-04-13 03:55:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:56,707 INFO L93 Difference]: Finished difference Result 313 states and 328 transitions. [2018-04-13 03:55:56,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 03:55:56,708 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 89 [2018-04-13 03:55:56,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:56,708 INFO L225 Difference]: With dead ends: 313 [2018-04-13 03:55:56,708 INFO L226 Difference]: Without dead ends: 313 [2018-04-13 03:55:56,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=293, Invalid=5257, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 03:55:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-13 03:55:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 178. [2018-04-13 03:55:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:55:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:55:56,709 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:55:56,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:56,709 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:55:56,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 03:55:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:55:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:55:56,710 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:56,710 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:56,710 INFO L408 AbstractCegarLoop]: === Iteration 128 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:56,710 INFO L82 PathProgramCache]: Analyzing trace with hash 740308801, now seen corresponding path program 67 times [2018-04-13 03:55:56,710 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:56,710 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:56,711 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:56,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:55:56,711 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:56,717 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:55:56,722 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:55:56,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:55:56,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:55:56,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:55:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:55:56,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:55:56,755 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-13 03:55:56,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:56,759 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-13 03:55:56,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:56,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:55:56,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:55:56,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:56,770 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-13 03:55:56,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:56,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:56,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:55:56,777 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-13 03:55:56,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:55:56,780 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-13 03:55:56,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:55:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 383 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:55:57,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:55:57,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 03:55:57,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 03:55:57,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 03:55:57,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 03:55:57,773 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 37 states. [2018-04-13 03:55:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:55:59,994 INFO L93 Difference]: Finished difference Result 309 states and 324 transitions. [2018-04-13 03:55:59,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 03:55:59,994 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 89 [2018-04-13 03:55:59,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:55:59,994 INFO L225 Difference]: With dead ends: 309 [2018-04-13 03:55:59,994 INFO L226 Difference]: Without dead ends: 309 [2018-04-13 03:55:59,995 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=262, Invalid=4568, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 03:55:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-13 03:55:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 178. [2018-04-13 03:55:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:55:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:55:59,996 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:55:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:55:59,996 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:55:59,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 03:55:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:55:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:55:59,997 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:55:59,997 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:55:59,997 INFO L408 AbstractCegarLoop]: === Iteration 129 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:55:59,997 INFO L82 PathProgramCache]: Analyzing trace with hash -607210998, now seen corresponding path program 68 times [2018-04-13 03:55:59,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:55:59,997 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:55:59,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:55:59,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:55:59,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:00,008 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:00,015 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:00,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:00,015 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:00,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:56:00,036 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:56:00,036 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:00,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:00,041 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-13 03:56:00,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:00,044 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-13 03:56:00,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:00,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:00,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:00,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:00,055 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-13 03:56:00,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:00,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:00,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:00,062 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-13 03:56:00,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:00,065 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-13 03:56:00,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:00,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:00,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 03:56:00,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 03:56:00,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 03:56:00,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 03:56:00,995 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 37 states. [2018-04-13 03:56:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:03,449 INFO L93 Difference]: Finished difference Result 369 states and 384 transitions. [2018-04-13 03:56:03,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 03:56:03,449 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 89 [2018-04-13 03:56:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:03,449 INFO L225 Difference]: With dead ends: 369 [2018-04-13 03:56:03,449 INFO L226 Difference]: Without dead ends: 369 [2018-04-13 03:56:03,450 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=264, Invalid=4566, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 03:56:03,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-04-13 03:56:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 178. [2018-04-13 03:56:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:56:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:56:03,451 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:56:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:03,451 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:56:03,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 03:56:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:56:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:56:03,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:03,451 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:03,452 INFO L408 AbstractCegarLoop]: === Iteration 130 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1976640095, now seen corresponding path program 69 times [2018-04-13 03:56:03,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:03,452 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:03,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:03,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:03,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:03,458 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:03,462 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:03,462 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:03,462 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:03,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:56:03,513 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-04-13 03:56:03,513 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:03,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:03,521 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-13 03:56:03,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:03,524 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-13 03:56:03,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:03,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:03,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:03,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:03,536 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-13 03:56:03,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:03,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:03,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:03,544 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-13 03:56:03,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:03,547 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-13 03:56:03,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:56:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:04,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:04,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 03:56:04,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 03:56:04,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 03:56:04,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:56:04,019 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 36 states. [2018-04-13 03:56:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:05,361 INFO L93 Difference]: Finished difference Result 424 states and 439 transitions. [2018-04-13 03:56:05,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 03:56:05,361 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 89 [2018-04-13 03:56:05,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:05,362 INFO L225 Difference]: With dead ends: 424 [2018-04-13 03:56:05,362 INFO L226 Difference]: Without dead ends: 424 [2018-04-13 03:56:05,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=260, Invalid=4432, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 03:56:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-04-13 03:56:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 178. [2018-04-13 03:56:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:56:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:56:05,363 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:56:05,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:05,363 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:56:05,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 03:56:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:56:05,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:56:05,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:05,364 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:05,364 INFO L408 AbstractCegarLoop]: === Iteration 131 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:05,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2113302614, now seen corresponding path program 70 times [2018-04-13 03:56:05,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:05,364 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:05,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:05,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:05,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:05,371 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:05,373 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:05,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:05,373 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:05,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:56:05,412 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:56:05,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:05,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:05,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-13 03:56:05,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:05,421 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-13 03:56:05,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:05,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:05,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:05,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:05,438 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-13 03:56:05,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:05,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:05,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:05,446 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-13 03:56:05,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:05,450 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-13 03:56:05,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:06,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:06,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 03:56:06,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 03:56:06,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 03:56:06,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:56:06,219 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 34 states. [2018-04-13 03:56:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:08,080 INFO L93 Difference]: Finished difference Result 474 states and 489 transitions. [2018-04-13 03:56:08,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:56:08,080 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-04-13 03:56:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:08,081 INFO L225 Difference]: With dead ends: 474 [2018-04-13 03:56:08,081 INFO L226 Difference]: Without dead ends: 474 [2018-04-13 03:56:08,081 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=236, Invalid=3796, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 03:56:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-04-13 03:56:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 178. [2018-04-13 03:56:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:56:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:56:08,082 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:56:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:08,082 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:56:08,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 03:56:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:56:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:56:08,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:08,083 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:08,083 INFO L408 AbstractCegarLoop]: === Iteration 132 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:08,083 INFO L82 PathProgramCache]: Analyzing trace with hash -255329279, now seen corresponding path program 71 times [2018-04-13 03:56:08,083 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:08,083 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:08,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:08,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:08,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:08,090 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:08,093 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:08,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:08,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:08,093 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:56:08,134 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-04-13 03:56:08,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:08,138 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:08,140 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-13 03:56:08,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:08,143 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-13 03:56:08,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:08,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:08,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:08,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:08,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:08,155 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 03:56:08,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:08,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 03:56:08,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:08,163 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-13 03:56:08,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:08,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:08,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 03:56:08,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 03:56:08,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 03:56:08,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:56:08,586 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 33 states. [2018-04-13 03:56:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:09,876 INFO L93 Difference]: Finished difference Result 519 states and 534 transitions. [2018-04-13 03:56:09,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 03:56:09,876 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 89 [2018-04-13 03:56:09,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:09,877 INFO L225 Difference]: With dead ends: 519 [2018-04-13 03:56:09,877 INFO L226 Difference]: Without dead ends: 519 [2018-04-13 03:56:09,877 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=3556, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 03:56:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-04-13 03:56:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 178. [2018-04-13 03:56:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:56:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:56:09,878 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:56:09,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:09,878 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:56:09,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 03:56:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:56:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:56:09,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:09,879 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:09,879 INFO L408 AbstractCegarLoop]: === Iteration 133 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:09,879 INFO L82 PathProgramCache]: Analyzing trace with hash 554628426, now seen corresponding path program 72 times [2018-04-13 03:56:09,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:09,879 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:09,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:09,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:09,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:09,886 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:09,888 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:09,888 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:09,889 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:09,889 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:56:09,939 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-04-13 03:56:09,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:09,944 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:09,945 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-13 03:56:09,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:09,949 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-13 03:56:09,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:09,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:09,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:09,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:09,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:09,960 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-13 03:56:09,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:09,965 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-13 03:56:09,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:09,968 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-13 03:56:09,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:10,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:10,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-13 03:56:10,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 03:56:10,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 03:56:10,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:56:10,328 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 32 states. [2018-04-13 03:56:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:11,656 INFO L93 Difference]: Finished difference Result 559 states and 574 transitions. [2018-04-13 03:56:11,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 03:56:11,657 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 89 [2018-04-13 03:56:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:11,657 INFO L225 Difference]: With dead ends: 559 [2018-04-13 03:56:11,657 INFO L226 Difference]: Without dead ends: 559 [2018-04-13 03:56:11,657 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=3324, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 03:56:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-04-13 03:56:11,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 178. [2018-04-13 03:56:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:56:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:56:11,659 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:56:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:11,659 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:56:11,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 03:56:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:56:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:56:11,659 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:11,659 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:11,660 INFO L408 AbstractCegarLoop]: === Iteration 134 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:11,660 INFO L82 PathProgramCache]: Analyzing trace with hash 471962209, now seen corresponding path program 73 times [2018-04-13 03:56:11,660 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:11,660 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:11,660 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:11,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:11,660 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:11,667 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:11,669 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:11,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:11,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:11,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:56:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:11,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:11,723 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-13 03:56:11,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:11,728 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-13 03:56:11,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:11,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:11,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:11,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:11,794 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-13 03:56:11,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:11,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:11,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:11,804 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-13 03:56:11,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:11,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:11,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-13 03:56:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 239 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:12,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:12,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 03:56:12,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 03:56:12,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 03:56:12,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:56:12,196 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 33 states. [2018-04-13 03:56:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:13,575 INFO L93 Difference]: Finished difference Result 594 states and 609 transitions. [2018-04-13 03:56:13,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:56:13,575 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 89 [2018-04-13 03:56:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:13,576 INFO L225 Difference]: With dead ends: 594 [2018-04-13 03:56:13,576 INFO L226 Difference]: Without dead ends: 594 [2018-04-13 03:56:13,576 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=3675, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 03:56:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-04-13 03:56:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 178. [2018-04-13 03:56:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:56:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:56:13,578 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:56:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:13,578 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:56:13,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 03:56:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:56:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:56:13,578 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:13,578 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:13,578 INFO L408 AbstractCegarLoop]: === Iteration 135 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:13,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1293360406, now seen corresponding path program 74 times [2018-04-13 03:56:13,578 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:13,578 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:13,579 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:13,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:56:13,579 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:13,587 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:13,589 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:13,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:13,589 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:13,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:56:13,607 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:56:13,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:13,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:13,614 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-13 03:56:13,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:13,617 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-13 03:56:13,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:13,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:13,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:13,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:13,628 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-13 03:56:13,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:13,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:13,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:13,634 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-13 03:56:13,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:13,637 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-13 03:56:13,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:14,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:14,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 03:56:14,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 03:56:14,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 03:56:14,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:56:14,086 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 31 states. [2018-04-13 03:56:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:15,636 INFO L93 Difference]: Finished difference Result 624 states and 639 transitions. [2018-04-13 03:56:15,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 03:56:15,636 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 89 [2018-04-13 03:56:15,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:15,637 INFO L225 Difference]: With dead ends: 624 [2018-04-13 03:56:15,637 INFO L226 Difference]: Without dead ends: 624 [2018-04-13 03:56:15,637 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=3102, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 03:56:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-04-13 03:56:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 178. [2018-04-13 03:56:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:56:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:56:15,638 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:56:15,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:15,638 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:56:15,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 03:56:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:56:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:56:15,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:15,639 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:15,639 INFO L408 AbstractCegarLoop]: === Iteration 136 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:15,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1945215169, now seen corresponding path program 75 times [2018-04-13 03:56:15,639 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:15,639 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:15,639 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:15,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:15,639 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:15,647 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:15,649 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:15,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:15,649 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:15,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:56:15,698 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-13 03:56:15,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:15,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:15,708 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-13 03:56:15,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:15,711 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-13 03:56:15,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:15,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:15,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:15,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:15,729 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-13 03:56:15,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:15,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:15,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:15,735 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-13 03:56:15,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:15,738 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-13 03:56:15,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:16,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:16,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 03:56:16,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 03:56:16,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 03:56:16,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:56:16,036 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 29 states. [2018-04-13 03:56:17,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:17,192 INFO L93 Difference]: Finished difference Result 649 states and 664 transitions. [2018-04-13 03:56:17,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 03:56:17,223 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-04-13 03:56:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:17,223 INFO L225 Difference]: With dead ends: 649 [2018-04-13 03:56:17,224 INFO L226 Difference]: Without dead ends: 649 [2018-04-13 03:56:17,224 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=2676, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 03:56:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-04-13 03:56:17,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 178. [2018-04-13 03:56:17,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:56:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:56:17,225 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:56:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:17,225 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:56:17,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 03:56:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:56:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:56:17,226 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:17,226 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:17,226 INFO L408 AbstractCegarLoop]: === Iteration 137 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:17,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1445025930, now seen corresponding path program 76 times [2018-04-13 03:56:17,226 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:17,226 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:17,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:17,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:17,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:17,235 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:17,237 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:17,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:17,237 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:17,237 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:56:17,275 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:56:17,275 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:17,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:17,283 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-13 03:56:17,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:17,286 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-13 03:56:17,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:17,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:17,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:17,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:17,306 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-13 03:56:17,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:17,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:17,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:17,312 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-13 03:56:17,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:17,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:17,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-13 03:56:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:17,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:17,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 03:56:17,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 03:56:17,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 03:56:17,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:56:17,750 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 29 states. [2018-04-13 03:56:19,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:19,213 INFO L93 Difference]: Finished difference Result 669 states and 684 transitions. [2018-04-13 03:56:19,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 03:56:19,213 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-04-13 03:56:19,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:19,213 INFO L225 Difference]: With dead ends: 669 [2018-04-13 03:56:19,213 INFO L226 Difference]: Without dead ends: 669 [2018-04-13 03:56:19,214 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=2780, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 03:56:19,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-04-13 03:56:19,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 178. [2018-04-13 03:56:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:56:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:56:19,215 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:56:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:19,215 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:56:19,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 03:56:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:56:19,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:56:19,215 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:19,215 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:19,216 INFO L408 AbstractCegarLoop]: === Iteration 138 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:19,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1802381089, now seen corresponding path program 77 times [2018-04-13 03:56:19,216 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:19,216 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:19,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:19,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:19,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:19,224 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:19,226 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:19,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:19,226 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:19,227 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:56:19,285 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 03:56:19,285 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:19,292 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:19,294 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-13 03:56:19,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:19,298 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-13 03:56:19,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:19,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:19,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:19,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:19,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:19,310 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 03:56:19,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:19,315 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-13 03:56:19,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:19,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:19,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-13 03:56:19,369 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-13 03:56:19,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:19,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:19,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:11 [2018-04-13 03:56:19,677 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:19,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:19,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 03:56:19,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 03:56:19,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 03:56:19,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:56:19,678 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 29 states. [2018-04-13 03:56:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:21,021 INFO L93 Difference]: Finished difference Result 684 states and 699 transitions. [2018-04-13 03:56:21,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 03:56:21,021 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-04-13 03:56:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:21,022 INFO L225 Difference]: With dead ends: 684 [2018-04-13 03:56:21,022 INFO L226 Difference]: Without dead ends: 684 [2018-04-13 03:56:21,022 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=2781, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 03:56:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-04-13 03:56:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 178. [2018-04-13 03:56:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:56:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:56:21,024 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:56:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:21,024 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:56:21,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 03:56:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:56:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:56:21,024 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:21,024 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:21,024 INFO L408 AbstractCegarLoop]: === Iteration 139 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:21,024 INFO L82 PathProgramCache]: Analyzing trace with hash -306031062, now seen corresponding path program 78 times [2018-04-13 03:56:21,024 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:21,024 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:21,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:21,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:21,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:21,033 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:21,035 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:21,035 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:21,035 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:21,035 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:56:21,118 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-13 03:56:21,118 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:21,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:21,129 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-13 03:56:21,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:21,132 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-13 03:56:21,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:21,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:21,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:21,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:21,144 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-13 03:56:21,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:21,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:21,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:21,150 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-13 03:56:21,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:21,153 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-13 03:56:21,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:21,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:21,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 03:56:21,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 03:56:21,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 03:56:21,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:56:21,416 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 26 states. [2018-04-13 03:56:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:22,459 INFO L93 Difference]: Finished difference Result 695 states and 710 transitions. [2018-04-13 03:56:22,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 03:56:22,459 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2018-04-13 03:56:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:22,460 INFO L225 Difference]: With dead ends: 695 [2018-04-13 03:56:22,460 INFO L226 Difference]: Without dead ends: 695 [2018-04-13 03:56:22,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=2100, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 03:56:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-04-13 03:56:22,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 178. [2018-04-13 03:56:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-13 03:56:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-13 03:56:22,461 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-13 03:56:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:22,462 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-13 03:56:22,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 03:56:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-13 03:56:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:56:22,462 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:22,462 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:22,462 INFO L408 AbstractCegarLoop]: === Iteration 140 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:22,462 INFO L82 PathProgramCache]: Analyzing trace with hash -515037823, now seen corresponding path program 13 times [2018-04-13 03:56:22,462 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:22,462 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:22,462 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:22,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:22,463 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:22,473 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:22,476 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:22,476 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:22,476 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:22,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:56:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:22,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:22,538 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-13 03:56:22,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:22,541 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-13 03:56:22,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:22,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:22,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:22,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:22,553 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-13 03:56:22,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:22,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:22,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:22,560 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-13 03:56:22,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:22,562 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-13 03:56:22,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:22,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:22,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 03:56:22,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 03:56:22,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 03:56:22,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:56:22,786 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 25 states. [2018-04-13 03:56:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:23,753 INFO L93 Difference]: Finished difference Result 708 states and 724 transitions. [2018-04-13 03:56:23,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 03:56:23,753 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 89 [2018-04-13 03:56:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:23,753 INFO L225 Difference]: With dead ends: 708 [2018-04-13 03:56:23,753 INFO L226 Difference]: Without dead ends: 708 [2018-04-13 03:56:23,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=1928, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 03:56:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-04-13 03:56:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 179. [2018-04-13 03:56:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-13 03:56:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2018-04-13 03:56:23,755 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 89 [2018-04-13 03:56:23,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:23,755 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2018-04-13 03:56:23,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 03:56:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2018-04-13 03:56:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 03:56:23,755 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:23,755 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:23,756 INFO L408 AbstractCegarLoop]: === Iteration 141 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:23,756 INFO L82 PathProgramCache]: Analyzing trace with hash -497148453, now seen corresponding path program 14 times [2018-04-13 03:56:23,756 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:23,756 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:23,756 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:23,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:56:23,756 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:23,765 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:23,767 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:23,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:23,767 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:23,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:56:23,803 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:56:23,803 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:23,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:23,811 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-13 03:56:23,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:23,814 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-13 03:56:23,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:23,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:23,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:23,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:23,825 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-13 03:56:23,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:23,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:23,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:23,831 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-13 03:56:23,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:23,834 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-13 03:56:23,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:24,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:24,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 03:56:24,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 03:56:24,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 03:56:24,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:56:24,016 INFO L87 Difference]: Start difference. First operand 179 states and 195 transitions. Second operand 23 states. [2018-04-13 03:56:24,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:24,867 INFO L93 Difference]: Finished difference Result 710 states and 727 transitions. [2018-04-13 03:56:24,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 03:56:24,867 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 89 [2018-04-13 03:56:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:24,868 INFO L225 Difference]: With dead ends: 710 [2018-04-13 03:56:24,868 INFO L226 Difference]: Without dead ends: 710 [2018-04-13 03:56:24,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=1598, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 03:56:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-04-13 03:56:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 183. [2018-04-13 03:56:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-13 03:56:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 199 transitions. [2018-04-13 03:56:24,869 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 199 transitions. Word has length 89 [2018-04-13 03:56:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:24,870 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 199 transitions. [2018-04-13 03:56:24,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 03:56:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 199 transitions. [2018-04-13 03:56:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:24,870 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:24,870 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:24,870 INFO L408 AbstractCegarLoop]: === Iteration 142 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:24,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1737807067, now seen corresponding path program 14 times [2018-04-13 03:56:24,870 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:24,870 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:24,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:24,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:24,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:24,877 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:24,880 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:24,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:24,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:24,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:56:24,897 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:56:24,897 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:24,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:24,904 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-13 03:56:24,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:24,907 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-13 03:56:24,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:24,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:24,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:56:24,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:24,922 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-13 03:56:24,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:24,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:24,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:24,929 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-13 03:56:24,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:24,932 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-13 03:56:24,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:56:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:26,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:26,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 03:56:26,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 03:56:26,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 03:56:26,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1557, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:56:26,197 INFO L87 Difference]: Start difference. First operand 183 states and 199 transitions. Second operand 41 states. [2018-04-13 03:56:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:28,808 INFO L93 Difference]: Finished difference Result 259 states and 275 transitions. [2018-04-13 03:56:28,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 03:56:28,808 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 94 [2018-04-13 03:56:28,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:28,808 INFO L225 Difference]: With dead ends: 259 [2018-04-13 03:56:28,809 INFO L226 Difference]: Without dead ends: 259 [2018-04-13 03:56:28,809 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=298, Invalid=5554, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 03:56:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-13 03:56:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 188. [2018-04-13 03:56:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:28,810 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:28,810 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:28,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 03:56:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:28,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:28,810 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:28,810 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:28,810 INFO L408 AbstractCegarLoop]: === Iteration 143 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:28,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1341150100, now seen corresponding path program 79 times [2018-04-13 03:56:28,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:28,811 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:28,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:28,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:28,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:28,817 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:28,820 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:28,820 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:28,820 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:28,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:56:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:28,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:28,842 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-13 03:56:28,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:28,845 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-13 03:56:28,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:28,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:28,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:28,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:28,856 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-13 03:56:28,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:28,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:28,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:28,862 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-13 03:56:28,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:28,865 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-13 03:56:28,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:29,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:29,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 03:56:29,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 03:56:29,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 03:56:29,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:56:29,505 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 41 states. [2018-04-13 03:56:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:31,204 INFO L93 Difference]: Finished difference Result 329 states and 345 transitions. [2018-04-13 03:56:31,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 03:56:31,204 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 94 [2018-04-13 03:56:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:31,204 INFO L225 Difference]: With dead ends: 329 [2018-04-13 03:56:31,204 INFO L226 Difference]: Without dead ends: 329 [2018-04-13 03:56:31,205 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=312, Invalid=6008, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 03:56:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-13 03:56:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 188. [2018-04-13 03:56:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:31,206 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:31,206 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:31,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 03:56:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:31,206 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:31,207 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:31,207 INFO L408 AbstractCegarLoop]: === Iteration 144 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:31,207 INFO L82 PathProgramCache]: Analyzing trace with hash 593200963, now seen corresponding path program 80 times [2018-04-13 03:56:31,207 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:31,207 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:31,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:31,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:56:31,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:31,213 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:31,217 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:31,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:31,218 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:31,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:56:31,236 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:56:31,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:31,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:31,241 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-13 03:56:31,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:31,245 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-13 03:56:31,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:31,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:31,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:31,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:31,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:31,257 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-13 03:56:31,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:31,261 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-13 03:56:31,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:31,264 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-13 03:56:31,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:32,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:32,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 03:56:32,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 03:56:32,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 03:56:32,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 03:56:32,406 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 40 states. [2018-04-13 03:56:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:34,977 INFO L93 Difference]: Finished difference Result 394 states and 410 transitions. [2018-04-13 03:56:34,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 03:56:34,977 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 94 [2018-04-13 03:56:34,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:34,977 INFO L225 Difference]: With dead ends: 394 [2018-04-13 03:56:34,977 INFO L226 Difference]: Without dead ends: 394 [2018-04-13 03:56:34,978 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=293, Invalid=5559, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 03:56:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-13 03:56:34,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 188. [2018-04-13 03:56:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:34,979 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:34,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:34,979 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:34,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 03:56:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:34,979 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:34,979 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:34,979 INFO L408 AbstractCegarLoop]: === Iteration 145 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:34,979 INFO L82 PathProgramCache]: Analyzing trace with hash -754318836, now seen corresponding path program 81 times [2018-04-13 03:56:34,979 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:34,979 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:34,980 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:34,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:34,980 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:34,986 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:34,990 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:34,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:34,990 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:34,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:56:35,039 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-04-13 03:56:35,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:35,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:35,045 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-13 03:56:35,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:35,049 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-13 03:56:35,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:35,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:35,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:35,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:35,060 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-13 03:56:35,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:35,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:35,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:35,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-13 03:56:35,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:35,083 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-13 03:56:35,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:35,152 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 11 treesize of output 1 [2018-04-13 03:56:35,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:35,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-13 03:56:35,157 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 5 treesize of output 1 [2018-04-13 03:56:35,157 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:35,157 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:35,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:35,160 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:11 [2018-04-13 03:56:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 349 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:35,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:35,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 03:56:35,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 03:56:35,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 03:56:35,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1557, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:56:35,701 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 41 states. [2018-04-13 03:56:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:37,744 INFO L93 Difference]: Finished difference Result 454 states and 470 transitions. [2018-04-13 03:56:37,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 03:56:37,744 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 94 [2018-04-13 03:56:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:37,745 INFO L225 Difference]: With dead ends: 454 [2018-04-13 03:56:37,745 INFO L226 Difference]: Without dead ends: 454 [2018-04-13 03:56:37,745 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=330, Invalid=5676, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 03:56:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-04-13 03:56:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 188. [2018-04-13 03:56:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:37,747 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:37,747 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:37,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 03:56:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:37,747 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:37,747 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:37,747 INFO L408 AbstractCegarLoop]: === Iteration 146 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:37,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2123747933, now seen corresponding path program 82 times [2018-04-13 03:56:37,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:37,747 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:37,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:37,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:37,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:37,754 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:37,756 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:37,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:37,756 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:37,757 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:56:37,785 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:56:37,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:37,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:37,791 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-13 03:56:37,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:37,794 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-13 03:56:37,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:37,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:37,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:37,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:37,804 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-13 03:56:37,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:37,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:37,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:37,810 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-13 03:56:37,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:37,813 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-13 03:56:37,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:38,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:38,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 03:56:38,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 03:56:38,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 03:56:38,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:56:38,787 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 36 states. [2018-04-13 03:56:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:40,848 INFO L93 Difference]: Finished difference Result 509 states and 525 transitions. [2018-04-13 03:56:40,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 03:56:40,848 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 94 [2018-04-13 03:56:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:40,849 INFO L225 Difference]: With dead ends: 509 [2018-04-13 03:56:40,849 INFO L226 Difference]: Without dead ends: 509 [2018-04-13 03:56:40,849 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=252, Invalid=4304, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 03:56:40,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-04-13 03:56:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 188. [2018-04-13 03:56:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:40,850 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:40,850 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:40,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 03:56:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:40,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:40,851 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:40,851 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:40,851 INFO L408 AbstractCegarLoop]: === Iteration 147 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:40,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2034556844, now seen corresponding path program 83 times [2018-04-13 03:56:40,851 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:40,851 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:40,851 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:40,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:40,851 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:40,858 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:40,860 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:40,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:40,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:40,860 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:56:40,896 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-04-13 03:56:40,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:40,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:40,901 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-13 03:56:40,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:40,905 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-13 03:56:40,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:40,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:40,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:40,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:40,916 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-13 03:56:40,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:40,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:40,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:40,922 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-13 03:56:40,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:40,926 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-13 03:56:40,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:41,037 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 5 treesize of output 1 [2018-04-13 03:56:41,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:41,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:41,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-04-13 03:56:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 291 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:41,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:41,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 03:56:41,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 03:56:41,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 03:56:41,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:56:41,457 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 36 states. [2018-04-13 03:56:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:43,056 INFO L93 Difference]: Finished difference Result 559 states and 575 transitions. [2018-04-13 03:56:43,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 03:56:43,056 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 94 [2018-04-13 03:56:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:43,057 INFO L225 Difference]: With dead ends: 559 [2018-04-13 03:56:43,057 INFO L226 Difference]: Without dead ends: 559 [2018-04-13 03:56:43,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=4303, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 03:56:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-04-13 03:56:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 188. [2018-04-13 03:56:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:43,059 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:43,059 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:43,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 03:56:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:43,059 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:43,059 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:43,059 INFO L408 AbstractCegarLoop]: === Iteration 148 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:43,059 INFO L82 PathProgramCache]: Analyzing trace with hash -402437117, now seen corresponding path program 84 times [2018-04-13 03:56:43,059 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:43,059 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:43,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:43,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:43,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:43,067 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:43,069 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:43,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:43,069 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:43,070 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:56:43,116 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-04-13 03:56:43,116 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:43,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:43,122 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-13 03:56:43,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:43,125 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-13 03:56:43,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:43,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:43,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:43,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:43,137 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-13 03:56:43,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:43,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:43,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:43,143 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-13 03:56:43,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:43,146 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-13 03:56:43,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:43,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:43,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 03:56:43,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 03:56:43,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 03:56:43,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:56:43,528 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 34 states. [2018-04-13 03:56:44,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:44,912 INFO L93 Difference]: Finished difference Result 604 states and 620 transitions. [2018-04-13 03:56:44,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:56:44,912 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 94 [2018-04-13 03:56:44,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:44,913 INFO L225 Difference]: With dead ends: 604 [2018-04-13 03:56:44,913 INFO L226 Difference]: Without dead ends: 604 [2018-04-13 03:56:44,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=232, Invalid=3800, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 03:56:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-04-13 03:56:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 188. [2018-04-13 03:56:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:44,915 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:44,915 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:44,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 03:56:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:44,915 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:44,915 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:44,915 INFO L408 AbstractCegarLoop]: === Iteration 149 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:44,915 INFO L82 PathProgramCache]: Analyzing trace with hash 407520588, now seen corresponding path program 85 times [2018-04-13 03:56:44,915 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:44,915 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:44,916 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:44,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:44,916 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:44,923 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:44,925 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:44,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:44,925 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:44,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:56:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:44,951 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:44,952 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-13 03:56:44,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:44,964 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-13 03:56:44,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:44,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:44,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:44,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:44,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:44,975 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-13 03:56:44,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:44,980 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-13 03:56:44,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:44,983 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-13 03:56:44,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:45,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:45,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 03:56:45,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 03:56:45,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 03:56:45,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:56:45,360 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 33 states. [2018-04-13 03:56:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:46,697 INFO L93 Difference]: Finished difference Result 644 states and 660 transitions. [2018-04-13 03:56:46,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 03:56:46,697 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2018-04-13 03:56:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:46,697 INFO L225 Difference]: With dead ends: 644 [2018-04-13 03:56:46,698 INFO L226 Difference]: Without dead ends: 644 [2018-04-13 03:56:46,698 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=3560, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 03:56:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-04-13 03:56:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 188. [2018-04-13 03:56:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:46,700 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:46,700 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:46,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 03:56:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:46,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:46,700 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:46,700 INFO L408 AbstractCegarLoop]: === Iteration 150 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:46,700 INFO L82 PathProgramCache]: Analyzing trace with hash 324854371, now seen corresponding path program 86 times [2018-04-13 03:56:46,700 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:46,700 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:46,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:46,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:56:46,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:46,709 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:46,711 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:46,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:46,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:46,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:56:46,741 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:56:46,741 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:46,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:46,748 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-13 03:56:46,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:46,752 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-13 03:56:46,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:46,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:46,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:46,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:46,764 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-13 03:56:46,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:46,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:46,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:46,774 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-13 03:56:46,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:46,777 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-13 03:56:46,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:47,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:47,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 03:56:47,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 03:56:47,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 03:56:47,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:56:47,390 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 34 states. [2018-04-13 03:56:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:49,257 INFO L93 Difference]: Finished difference Result 679 states and 695 transitions. [2018-04-13 03:56:49,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 03:56:49,257 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 94 [2018-04-13 03:56:49,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:49,257 INFO L225 Difference]: With dead ends: 679 [2018-04-13 03:56:49,258 INFO L226 Difference]: Without dead ends: 679 [2018-04-13 03:56:49,258 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=233, Invalid=3927, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 03:56:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-04-13 03:56:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 188. [2018-04-13 03:56:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:49,259 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:49,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:49,259 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:49,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 03:56:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:49,260 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:49,260 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:49,260 INFO L408 AbstractCegarLoop]: === Iteration 151 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:49,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1440468244, now seen corresponding path program 87 times [2018-04-13 03:56:49,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:49,260 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:49,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:49,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:49,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:49,268 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:49,270 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:49,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:49,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:49,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:56:49,339 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-13 03:56:49,339 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:49,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:49,348 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-13 03:56:49,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:49,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-13 03:56:49,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:49,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:49,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:49,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:49,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:49,372 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-13 03:56:49,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:49,376 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-13 03:56:49,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:49,380 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-13 03:56:49,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:49,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:49,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-13 03:56:49,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 03:56:49,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 03:56:49,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:56:49,763 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 32 states. [2018-04-13 03:56:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:51,164 INFO L93 Difference]: Finished difference Result 709 states and 725 transitions. [2018-04-13 03:56:51,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 03:56:51,164 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 94 [2018-04-13 03:56:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:51,165 INFO L225 Difference]: With dead ends: 709 [2018-04-13 03:56:51,165 INFO L226 Difference]: Without dead ends: 709 [2018-04-13 03:56:51,165 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=3441, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 03:56:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-04-13 03:56:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 188. [2018-04-13 03:56:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:51,167 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:51,167 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:51,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 03:56:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:51,167 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:51,167 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:51,167 INFO L408 AbstractCegarLoop]: === Iteration 152 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:51,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1798107331, now seen corresponding path program 88 times [2018-04-13 03:56:51,167 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:51,167 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:51,168 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:51,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:51,168 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:51,176 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:51,178 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:51,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:51,178 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:51,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:56:51,233 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:56:51,233 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:51,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:51,242 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-13 03:56:51,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:51,245 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-13 03:56:51,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:51,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:51,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:51,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:51,255 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-13 03:56:51,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:51,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:51,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:51,270 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-13 03:56:51,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:51,273 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-13 03:56:51,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:51,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:51,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-13 03:56:51,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 03:56:51,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 03:56:51,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-04-13 03:56:51,679 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 30 states. [2018-04-13 03:56:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:53,173 INFO L93 Difference]: Finished difference Result 734 states and 750 transitions. [2018-04-13 03:56:53,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 03:56:53,173 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 94 [2018-04-13 03:56:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:53,173 INFO L225 Difference]: With dead ends: 734 [2018-04-13 03:56:53,173 INFO L226 Difference]: Without dead ends: 734 [2018-04-13 03:56:53,173 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=2888, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 03:56:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-04-13 03:56:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 188. [2018-04-13 03:56:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:53,175 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:53,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:53,175 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:53,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 03:56:53,175 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:53,175 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:53,175 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:53,175 INFO L408 AbstractCegarLoop]: === Iteration 153 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:53,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1297918092, now seen corresponding path program 89 times [2018-04-13 03:56:53,176 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:53,176 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:53,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:53,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:53,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:53,185 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:53,187 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:53,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:53,187 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:53,187 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:56:53,249 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 03:56:53,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:53,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:53,259 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-13 03:56:53,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:53,271 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-13 03:56:53,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:53,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:53,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:53,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:53,283 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-13 03:56:53,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:53,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:53,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:53,290 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 17 treesize of output 24 [2018-04-13 03:56:53,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:53,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:56:53,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:56:53,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:56:53,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:53,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:53,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 03:56:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 0 proven. 357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:53,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:53,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-13 03:56:53,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 03:56:53,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 03:56:53,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=810, Unknown=0, NotChecked=0, Total=870 [2018-04-13 03:56:53,727 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 30 states. [2018-04-13 03:56:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:55,313 INFO L93 Difference]: Finished difference Result 754 states and 770 transitions. [2018-04-13 03:56:55,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 03:56:55,313 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 94 [2018-04-13 03:56:55,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:55,314 INFO L225 Difference]: With dead ends: 754 [2018-04-13 03:56:55,314 INFO L226 Difference]: Without dead ends: 754 [2018-04-13 03:56:55,314 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=2890, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 03:56:55,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-04-13 03:56:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 188. [2018-04-13 03:56:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:55,316 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:55,316 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:55,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 03:56:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:55,316 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:55,317 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:55,317 INFO L408 AbstractCegarLoop]: === Iteration 154 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:55,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1655273251, now seen corresponding path program 90 times [2018-04-13 03:56:55,317 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:55,317 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:55,317 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:55,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:55,317 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:55,326 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:55,329 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:55,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:55,329 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:55,329 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:56:55,425 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-13 03:56:55,425 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:55,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:55,439 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-13 03:56:55,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:55,442 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-13 03:56:55,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:55,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:55,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:55,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:55,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:55,456 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-13 03:56:55,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:55,462 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-13 03:56:55,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:55,465 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-13 03:56:55,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:55,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:55,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 03:56:55,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:56:55,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:56:55,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:56:55,803 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 28 states. [2018-04-13 03:56:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:57,053 INFO L93 Difference]: Finished difference Result 769 states and 785 transitions. [2018-04-13 03:56:57,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:56:57,053 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2018-04-13 03:56:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:57,054 INFO L225 Difference]: With dead ends: 769 [2018-04-13 03:56:57,054 INFO L226 Difference]: Without dead ends: 769 [2018-04-13 03:56:57,054 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=2480, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 03:56:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-04-13 03:56:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 188. [2018-04-13 03:56:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:57,056 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:57,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:57,056 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:57,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:56:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:57,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:57,056 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:57,056 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:57,056 INFO L408 AbstractCegarLoop]: === Iteration 155 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash -453138900, now seen corresponding path program 91 times [2018-04-13 03:56:57,056 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:57,056 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:57,057 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:57,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:56:57,057 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:57,067 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:57,069 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:57,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:57,069 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:57,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:56:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:57,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:57,128 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-13 03:56:57,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:57,131 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-13 03:56:57,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:57,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:57,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:57,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:57,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:57,143 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-13 03:56:57,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:57,147 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-13 03:56:57,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:57,151 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-13 03:56:57,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:57,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:57,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 03:56:57,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 03:56:57,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 03:56:57,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:56:57,420 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 27 states. [2018-04-13 03:56:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:56:58,647 INFO L93 Difference]: Finished difference Result 780 states and 796 transitions. [2018-04-13 03:56:58,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 03:56:58,647 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 94 [2018-04-13 03:56:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:56:58,648 INFO L225 Difference]: With dead ends: 780 [2018-04-13 03:56:58,648 INFO L226 Difference]: Without dead ends: 780 [2018-04-13 03:56:58,648 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=2288, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 03:56:58,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-04-13 03:56:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 188. [2018-04-13 03:56:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:56:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2018-04-13 03:56:58,650 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 94 [2018-04-13 03:56:58,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:56:58,650 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2018-04-13 03:56:58,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 03:56:58,650 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2018-04-13 03:56:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:56:58,651 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:56:58,651 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:56:58,651 INFO L408 AbstractCegarLoop]: === Iteration 156 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:56:58,651 INFO L82 PathProgramCache]: Analyzing trace with hash -662145661, now seen corresponding path program 14 times [2018-04-13 03:56:58,651 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:56:58,651 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:56:58,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:58,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:56:58,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:56:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:56:58,663 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:56:58,667 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:56:58,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:56:58,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:56:58,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:56:58,693 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:56:58,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:56:58,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:56:58,704 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-13 03:56:58,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:58,708 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-13 03:56:58,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:58,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:56:58,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:56:58,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:58,719 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-13 03:56:58,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:58,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:58,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:56:58,725 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-13 03:56:58,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:56:58,728 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-13 03:56:58,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:56:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:56:58,989 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:56:58,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 03:56:58,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 03:56:58,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 03:56:58,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:56:58,989 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 26 states. [2018-04-13 03:57:00,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:00,095 INFO L93 Difference]: Finished difference Result 793 states and 810 transitions. [2018-04-13 03:57:00,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 03:57:00,096 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 94 [2018-04-13 03:57:00,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:00,096 INFO L225 Difference]: With dead ends: 793 [2018-04-13 03:57:00,096 INFO L226 Difference]: Without dead ends: 793 [2018-04-13 03:57:00,096 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=2108, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 03:57:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-04-13 03:57:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 189. [2018-04-13 03:57:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-13 03:57:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2018-04-13 03:57:00,098 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 94 [2018-04-13 03:57:00,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:00,098 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2018-04-13 03:57:00,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 03:57:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2018-04-13 03:57:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 03:57:00,099 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:00,099 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:00,099 INFO L408 AbstractCegarLoop]: === Iteration 157 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash -644256291, now seen corresponding path program 15 times [2018-04-13 03:57:00,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:00,099 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:00,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:00,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:00,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:00,109 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:00,111 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:00,111 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:00,111 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:00,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:57:00,189 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-13 03:57:00,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:00,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:00,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:57:00,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:00,205 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-13 03:57:00,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:00,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:00,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:00,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:00,216 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-13 03:57:00,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:00,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:00,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:00,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 03:57:00,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:00,225 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-13 03:57:00,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:00,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:00,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 03:57:00,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 03:57:00,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 03:57:00,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:57:00,418 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand 24 states. [2018-04-13 03:57:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:01,368 INFO L93 Difference]: Finished difference Result 795 states and 813 transitions. [2018-04-13 03:57:01,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 03:57:01,368 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 94 [2018-04-13 03:57:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:01,369 INFO L225 Difference]: With dead ends: 795 [2018-04-13 03:57:01,369 INFO L226 Difference]: Without dead ends: 795 [2018-04-13 03:57:01,369 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=1762, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 03:57:01,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-04-13 03:57:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 193. [2018-04-13 03:57:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-13 03:57:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 210 transitions. [2018-04-13 03:57:01,371 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 210 transitions. Word has length 94 [2018-04-13 03:57:01,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:01,371 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 210 transitions. [2018-04-13 03:57:01,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 03:57:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 210 transitions. [2018-04-13 03:57:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:01,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:01,371 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:01,371 INFO L408 AbstractCegarLoop]: === Iteration 158 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:01,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1867151608, now seen corresponding path program 15 times [2018-04-13 03:57:01,372 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:01,372 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:01,372 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:01,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:01,372 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:01,378 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:01,382 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:01,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:01,382 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:01,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:57:01,431 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-13 03:57:01,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:01,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:01,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:57:01,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:01,439 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-13 03:57:01,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:01,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:01,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:01,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:01,450 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-13 03:57:01,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:01,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:01,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:01,456 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-13 03:57:01,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:01,459 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-13 03:57:01,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:02,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:02,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 03:57:02,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 03:57:02,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 03:57:02,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 03:57:02,365 INFO L87 Difference]: Start difference. First operand 193 states and 210 transitions. Second operand 43 states. [2018-04-13 03:57:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:04,061 INFO L93 Difference]: Finished difference Result 274 states and 291 transitions. [2018-04-13 03:57:04,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 03:57:04,061 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 99 [2018-04-13 03:57:04,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:04,062 INFO L225 Difference]: With dead ends: 274 [2018-04-13 03:57:04,062 INFO L226 Difference]: Without dead ends: 274 [2018-04-13 03:57:04,062 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=325, Invalid=6481, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 03:57:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-13 03:57:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 198. [2018-04-13 03:57:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:04,063 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:04,064 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:04,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 03:57:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:04,064 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:04,064 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:04,064 INFO L408 AbstractCegarLoop]: === Iteration 159 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:04,064 INFO L82 PathProgramCache]: Analyzing trace with hash 971094561, now seen corresponding path program 92 times [2018-04-13 03:57:04,064 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:04,064 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:04,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:04,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:04,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:04,071 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:04,076 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:04,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:04,076 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:04,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:57:04,091 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:57:04,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:04,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:04,097 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-13 03:57:04,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:04,101 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-13 03:57:04,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:04,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:04,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:04,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:04,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:04,113 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-13 03:57:04,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:04,117 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-13 03:57:04,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:04,120 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-13 03:57:04,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 516 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:08,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:08,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 03:57:08,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 03:57:08,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 03:57:08,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:57:08,775 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 41 states. [2018-04-13 03:57:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:11,560 INFO L93 Difference]: Finished difference Result 349 states and 366 transitions. [2018-04-13 03:57:11,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 03:57:11,560 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-04-13 03:57:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:11,560 INFO L225 Difference]: With dead ends: 349 [2018-04-13 03:57:11,561 INFO L226 Difference]: Without dead ends: 349 [2018-04-13 03:57:11,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=298, Invalid=5708, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 03:57:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-13 03:57:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 198. [2018-04-13 03:57:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:11,562 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:11,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:11,562 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:11,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 03:57:11,563 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:11,563 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:11,563 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:11,563 INFO L408 AbstractCegarLoop]: === Iteration 160 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:11,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1932522070, now seen corresponding path program 93 times [2018-04-13 03:57:11,563 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:11,563 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:11,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:11,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:11,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:11,570 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:11,574 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:11,574 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:11,574 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:11,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:57:11,607 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-04-13 03:57:11,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:11,612 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:11,614 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-13 03:57:11,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:11,624 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-13 03:57:11,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:11,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:11,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:11,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:11,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:11,635 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-13 03:57:11,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:11,640 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-13 03:57:11,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:11,643 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-13 03:57:11,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:12,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:12,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-13 03:57:12,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-13 03:57:12,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-13 03:57:12,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1639, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 03:57:12,286 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 42 states. [2018-04-13 03:57:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:14,072 INFO L93 Difference]: Finished difference Result 419 states and 436 transitions. [2018-04-13 03:57:14,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 03:57:14,073 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 99 [2018-04-13 03:57:14,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:14,073 INFO L225 Difference]: With dead ends: 419 [2018-04-13 03:57:14,073 INFO L226 Difference]: Without dead ends: 419 [2018-04-13 03:57:14,074 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 03:57:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-04-13 03:57:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 198. [2018-04-13 03:57:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:14,075 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:14,075 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:14,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-13 03:57:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:14,076 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:14,076 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:14,076 INFO L408 AbstractCegarLoop]: === Iteration 161 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:14,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1828993, now seen corresponding path program 94 times [2018-04-13 03:57:14,076 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:14,076 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:14,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:14,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:14,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:14,083 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:14,088 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:14,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:14,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:14,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:57:14,107 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:57:14,107 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:14,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:14,113 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-13 03:57:14,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:14,116 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-13 03:57:14,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:14,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:14,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:14,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:14,126 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-13 03:57:14,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:14,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:14,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:14,132 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-13 03:57:14,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:14,135 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-13 03:57:14,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:14,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:14,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 03:57:14,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 03:57:14,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 03:57:14,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1559, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:57:14,757 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 41 states. [2018-04-13 03:57:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:16,602 INFO L93 Difference]: Finished difference Result 484 states and 501 transitions. [2018-04-13 03:57:16,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 03:57:16,603 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-04-13 03:57:16,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:16,603 INFO L225 Difference]: With dead ends: 484 [2018-04-13 03:57:16,603 INFO L226 Difference]: Without dead ends: 484 [2018-04-13 03:57:16,604 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=302, Invalid=5860, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 03:57:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-04-13 03:57:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 198. [2018-04-13 03:57:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:16,605 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:16,605 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:16,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 03:57:16,605 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:16,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:16,606 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:16,606 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:16,606 INFO L408 AbstractCegarLoop]: === Iteration 162 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:16,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1345690806, now seen corresponding path program 95 times [2018-04-13 03:57:16,606 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:16,606 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:16,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:16,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:16,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:16,614 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:16,616 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:16,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:16,616 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:16,616 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:57:16,645 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 03:57:16,645 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:16,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:16,652 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-13 03:57:16,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:16,663 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-13 03:57:16,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:16,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:16,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:16,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:16,676 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-13 03:57:16,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:16,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:16,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:16,683 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-13 03:57:16,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:16,686 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-13 03:57:16,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:16,826 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 5 treesize of output 1 [2018-04-13 03:57:16,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:16,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:16,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-04-13 03:57:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:17,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:17,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 03:57:17,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 03:57:17,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 03:57:17,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1480, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 03:57:17,247 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 40 states. [2018-04-13 03:57:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:18,887 INFO L93 Difference]: Finished difference Result 544 states and 561 transitions. [2018-04-13 03:57:18,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 03:57:18,887 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 99 [2018-04-13 03:57:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:18,888 INFO L225 Difference]: With dead ends: 544 [2018-04-13 03:57:18,888 INFO L226 Difference]: Without dead ends: 544 [2018-04-13 03:57:18,888 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=288, Invalid=5412, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 03:57:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-04-13 03:57:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 198. [2018-04-13 03:57:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:18,890 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:18,890 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:18,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 03:57:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:18,890 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:18,890 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:18,890 INFO L408 AbstractCegarLoop]: === Iteration 163 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:18,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1579847393, now seen corresponding path program 96 times [2018-04-13 03:57:18,891 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:18,891 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:18,891 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:18,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:18,891 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:18,899 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:18,901 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:18,901 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:18,901 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:18,901 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:57:18,935 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-04-13 03:57:18,935 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:18,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:18,941 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-13 03:57:18,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:18,944 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-13 03:57:18,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:18,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:18,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:18,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:18,954 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-13 03:57:18,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:18,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:18,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:18,960 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-13 03:57:18,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:18,963 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-13 03:57:18,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:19,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:19,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 03:57:19,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 03:57:19,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 03:57:19,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:57:19,480 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 38 states. [2018-04-13 03:57:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:21,160 INFO L93 Difference]: Finished difference Result 599 states and 616 transitions. [2018-04-13 03:57:21,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 03:57:21,160 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 99 [2018-04-13 03:57:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:21,161 INFO L225 Difference]: With dead ends: 599 [2018-04-13 03:57:21,161 INFO L226 Difference]: Without dead ends: 599 [2018-04-13 03:57:21,161 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=275, Invalid=4981, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 03:57:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-04-13 03:57:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 198. [2018-04-13 03:57:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:21,163 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:21,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:21,163 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:21,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 03:57:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:21,164 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:21,164 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:21,164 INFO L408 AbstractCegarLoop]: === Iteration 164 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:21,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1443184874, now seen corresponding path program 97 times [2018-04-13 03:57:21,164 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:21,164 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:21,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:21,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:21,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:21,172 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:21,174 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:21,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:21,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:21,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:57:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:21,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:21,203 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-13 03:57:21,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:21,206 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-13 03:57:21,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:21,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:21,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:21,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:21,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:21,225 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-13 03:57:21,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:21,240 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-13 03:57:21,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:21,244 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-13 03:57:21,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:21,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:21,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 03:57:21,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 03:57:21,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 03:57:21,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 03:57:21,794 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 37 states. [2018-04-13 03:57:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:23,543 INFO L93 Difference]: Finished difference Result 649 states and 666 transitions. [2018-04-13 03:57:23,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 03:57:23,543 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 99 [2018-04-13 03:57:23,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:23,544 INFO L225 Difference]: With dead ends: 649 [2018-04-13 03:57:23,544 INFO L226 Difference]: Without dead ends: 649 [2018-04-13 03:57:23,544 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=261, Invalid=4709, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 03:57:23,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-04-13 03:57:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 198. [2018-04-13 03:57:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:23,546 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:23,546 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:23,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 03:57:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:23,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:23,546 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:23,546 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:23,547 INFO L408 AbstractCegarLoop]: === Iteration 165 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:23,547 INFO L82 PathProgramCache]: Analyzing trace with hash -993809087, now seen corresponding path program 98 times [2018-04-13 03:57:23,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:23,547 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:23,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:23,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:57:23,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:23,555 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:23,558 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:23,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:23,558 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:23,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:57:23,577 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:57:23,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:23,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:23,584 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-13 03:57:23,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:23,588 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-13 03:57:23,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:23,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:23,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:23,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:23,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:23,599 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-13 03:57:23,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:23,603 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-13 03:57:23,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:23,606 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-13 03:57:23,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:24,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:24,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 03:57:24,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 03:57:24,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 03:57:24,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 03:57:24,324 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 35 states. [2018-04-13 03:57:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:26,383 INFO L93 Difference]: Finished difference Result 694 states and 711 transitions. [2018-04-13 03:57:26,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 03:57:26,383 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 99 [2018-04-13 03:57:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:26,383 INFO L225 Difference]: With dead ends: 694 [2018-04-13 03:57:26,383 INFO L226 Difference]: Without dead ends: 694 [2018-04-13 03:57:26,384 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=238, Invalid=4052, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 03:57:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-04-13 03:57:26,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 198. [2018-04-13 03:57:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:26,385 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:26,385 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:26,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 03:57:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:26,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:26,386 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:26,386 INFO L408 AbstractCegarLoop]: === Iteration 166 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:26,386 INFO L82 PathProgramCache]: Analyzing trace with hash -183851382, now seen corresponding path program 99 times [2018-04-13 03:57:26,386 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:26,386 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:26,386 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:26,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:26,386 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:26,394 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:26,396 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:26,396 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:26,396 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:26,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:57:26,443 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-04-13 03:57:26,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:26,448 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:26,450 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-13 03:57:26,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:26,454 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-13 03:57:26,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:26,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:26,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:26,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:26,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:26,465 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-13 03:57:26,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:26,469 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-13 03:57:26,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:26,472 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-13 03:57:26,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:26,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:26,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 03:57:26,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 03:57:26,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 03:57:26,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:57:26,889 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 34 states. [2018-04-13 03:57:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:28,322 INFO L93 Difference]: Finished difference Result 734 states and 751 transitions. [2018-04-13 03:57:28,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:57:28,322 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 99 [2018-04-13 03:57:28,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:28,323 INFO L225 Difference]: With dead ends: 734 [2018-04-13 03:57:28,323 INFO L226 Difference]: Without dead ends: 734 [2018-04-13 03:57:28,323 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=228, Invalid=3804, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 03:57:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-04-13 03:57:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 198. [2018-04-13 03:57:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:28,325 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:28,325 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:28,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 03:57:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:28,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:28,325 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:28,325 INFO L408 AbstractCegarLoop]: === Iteration 167 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:28,325 INFO L82 PathProgramCache]: Analyzing trace with hash -266517599, now seen corresponding path program 100 times [2018-04-13 03:57:28,325 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:28,326 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:28,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:28,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:28,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:28,334 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:28,337 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:28,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:28,337 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:28,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:57:28,385 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:57:28,385 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:28,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:28,392 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-13 03:57:28,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:28,396 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-13 03:57:28,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:28,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:28,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:28,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:28,407 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-13 03:57:28,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:28,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:28,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:28,413 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-13 03:57:28,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:28,416 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-13 03:57:28,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:28,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:28,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 03:57:28,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 03:57:28,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 03:57:28,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 03:57:28,947 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 35 states. [2018-04-13 03:57:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:30,785 INFO L93 Difference]: Finished difference Result 769 states and 786 transitions. [2018-04-13 03:57:30,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 03:57:30,785 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 99 [2018-04-13 03:57:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:30,785 INFO L225 Difference]: With dead ends: 769 [2018-04-13 03:57:30,785 INFO L226 Difference]: Without dead ends: 769 [2018-04-13 03:57:30,786 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=248, Invalid=4308, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 03:57:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-04-13 03:57:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 198. [2018-04-13 03:57:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:30,788 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:30,788 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:30,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 03:57:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:30,788 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:30,788 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:30,788 INFO L408 AbstractCegarLoop]: === Iteration 168 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2031840214, now seen corresponding path program 101 times [2018-04-13 03:57:30,788 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:30,788 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:30,789 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:30,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:30,789 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:30,798 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:30,800 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:30,800 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:30,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:30,800 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:57:30,862 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-04-13 03:57:30,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:30,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:30,871 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-13 03:57:30,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:30,874 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-13 03:57:30,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:30,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:30,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:30,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:30,885 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-13 03:57:30,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:30,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:30,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:30,892 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 03:57:30,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:30,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:30,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-13 03:57:30,963 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-13 03:57:30,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:30,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:30,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:15 [2018-04-13 03:57:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:31,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:31,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 03:57:31,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 03:57:31,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 03:57:31,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 03:57:31,340 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 35 states. [2018-04-13 03:57:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:32,974 INFO L93 Difference]: Finished difference Result 799 states and 816 transitions. [2018-04-13 03:57:32,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 03:57:32,975 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 99 [2018-04-13 03:57:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:32,975 INFO L225 Difference]: With dead ends: 799 [2018-04-13 03:57:32,975 INFO L226 Difference]: Without dead ends: 799 [2018-04-13 03:57:32,976 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=240, Invalid=4182, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 03:57:32,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-04-13 03:57:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 198. [2018-04-13 03:57:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:32,978 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:32,978 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:32,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 03:57:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:32,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:32,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:32,978 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:32,978 INFO L408 AbstractCegarLoop]: === Iteration 169 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:32,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1206735361, now seen corresponding path program 102 times [2018-04-13 03:57:32,978 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:32,978 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:32,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:32,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:32,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:32,989 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:32,992 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:32,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:32,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:32,992 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:57:33,083 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-04-13 03:57:33,083 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:33,092 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:33,094 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-13 03:57:33,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:33,097 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-13 03:57:33,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:33,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:33,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:33,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:33,108 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-13 03:57:33,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:33,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:33,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:33,113 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-13 03:57:33,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:33,116 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-13 03:57:33,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:33,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:33,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 03:57:33,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 03:57:33,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 03:57:33,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:57:33,433 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 31 states. [2018-04-13 03:57:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:34,772 INFO L93 Difference]: Finished difference Result 824 states and 841 transitions. [2018-04-13 03:57:34,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 03:57:34,773 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 99 [2018-04-13 03:57:34,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:34,773 INFO L225 Difference]: With dead ends: 824 [2018-04-13 03:57:34,773 INFO L226 Difference]: Without dead ends: 824 [2018-04-13 03:57:34,774 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=3108, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 03:57:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2018-04-13 03:57:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 198. [2018-04-13 03:57:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:34,775 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:34,776 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:34,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 03:57:34,776 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:34,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:34,776 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:34,776 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:34,776 INFO L408 AbstractCegarLoop]: === Iteration 170 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:34,776 INFO L82 PathProgramCache]: Analyzing trace with hash 706546122, now seen corresponding path program 103 times [2018-04-13 03:57:34,776 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:34,776 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:34,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:34,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:34,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:34,786 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:34,789 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:34,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:34,789 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:34,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:57:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:34,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:34,848 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-13 03:57:34,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:34,857 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-13 03:57:34,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:34,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:34,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:34,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:34,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:34,868 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-13 03:57:34,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:34,872 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-13 03:57:34,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:34,875 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-13 03:57:34,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:35,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:35,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-13 03:57:35,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 03:57:35,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 03:57:35,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-04-13 03:57:35,177 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 30 states. [2018-04-13 03:57:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:36,471 INFO L93 Difference]: Finished difference Result 844 states and 861 transitions. [2018-04-13 03:57:36,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 03:57:36,471 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 99 [2018-04-13 03:57:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:36,472 INFO L225 Difference]: With dead ends: 844 [2018-04-13 03:57:36,472 INFO L226 Difference]: Without dead ends: 844 [2018-04-13 03:57:36,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=2892, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 03:57:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-04-13 03:57:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 198. [2018-04-13 03:57:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:36,474 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:36,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:36,474 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:36,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 03:57:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:36,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:36,475 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:36,475 INFO L408 AbstractCegarLoop]: === Iteration 171 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:36,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1063901281, now seen corresponding path program 104 times [2018-04-13 03:57:36,475 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:36,475 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:36,475 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:36,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:57:36,475 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:36,485 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:36,489 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:36,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:36,490 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:36,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:57:36,531 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:57:36,531 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:36,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:36,545 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-13 03:57:36,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:36,549 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-13 03:57:36,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:36,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:36,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:36,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:36,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:36,562 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-13 03:57:36,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:36,576 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-13 03:57:36,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:36,580 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-13 03:57:36,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 468 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:36,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:36,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 03:57:36,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 03:57:36,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 03:57:36,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:57:36,967 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 29 states. [2018-04-13 03:57:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:38,376 INFO L93 Difference]: Finished difference Result 859 states and 876 transitions. [2018-04-13 03:57:38,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 03:57:38,377 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 99 [2018-04-13 03:57:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:38,377 INFO L225 Difference]: With dead ends: 859 [2018-04-13 03:57:38,377 INFO L226 Difference]: Without dead ends: 859 [2018-04-13 03:57:38,378 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=2684, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 03:57:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-04-13 03:57:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 198. [2018-04-13 03:57:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:38,380 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:38,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:38,380 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:38,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 03:57:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:38,380 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:38,380 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:38,380 INFO L408 AbstractCegarLoop]: === Iteration 172 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:38,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1044510870, now seen corresponding path program 105 times [2018-04-13 03:57:38,380 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:38,380 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:38,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:38,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:38,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:38,392 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:38,395 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:38,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:38,395 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:38,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:57:38,470 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-04-13 03:57:38,470 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:38,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:38,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:57:38,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:38,508 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-13 03:57:38,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:38,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:38,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:38,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:38,519 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-13 03:57:38,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:38,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:38,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:38,532 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-13 03:57:38,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:38,535 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-13 03:57:38,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:38,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:38,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 03:57:38,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:57:38,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:57:38,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:57:38,831 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 28 states. [2018-04-13 03:57:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:40,173 INFO L93 Difference]: Finished difference Result 870 states and 887 transitions. [2018-04-13 03:57:40,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:57:40,174 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 99 [2018-04-13 03:57:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:40,174 INFO L225 Difference]: With dead ends: 870 [2018-04-13 03:57:40,174 INFO L226 Difference]: Without dead ends: 870 [2018-04-13 03:57:40,175 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=2484, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 03:57:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-04-13 03:57:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 198. [2018-04-13 03:57:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 03:57:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 215 transitions. [2018-04-13 03:57:40,176 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 215 transitions. Word has length 99 [2018-04-13 03:57:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:40,177 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 215 transitions. [2018-04-13 03:57:40,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:57:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 215 transitions. [2018-04-13 03:57:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:40,177 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:40,177 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:40,177 INFO L408 AbstractCegarLoop]: === Iteration 173 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:40,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1253517631, now seen corresponding path program 15 times [2018-04-13 03:57:40,177 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:40,177 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:40,178 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:40,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:40,178 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:40,190 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:40,195 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:40,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:40,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:40,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:57:40,292 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-13 03:57:40,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:40,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:40,312 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-13 03:57:40,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:40,315 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-13 03:57:40,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:40,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:40,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:40,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:40,326 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-13 03:57:40,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:40,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:40,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:40,333 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-13 03:57:40,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:40,336 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-13 03:57:40,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:40,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:40,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 03:57:40,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 03:57:40,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 03:57:40,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:57:40,603 INFO L87 Difference]: Start difference. First operand 198 states and 215 transitions. Second operand 27 states. [2018-04-13 03:57:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:41,831 INFO L93 Difference]: Finished difference Result 883 states and 901 transitions. [2018-04-13 03:57:41,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 03:57:41,831 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 99 [2018-04-13 03:57:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:41,831 INFO L225 Difference]: With dead ends: 883 [2018-04-13 03:57:41,832 INFO L226 Difference]: Without dead ends: 883 [2018-04-13 03:57:41,832 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=2296, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 03:57:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2018-04-13 03:57:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 199. [2018-04-13 03:57:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-13 03:57:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 217 transitions. [2018-04-13 03:57:41,834 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 217 transitions. Word has length 99 [2018-04-13 03:57:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:41,834 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 217 transitions. [2018-04-13 03:57:41,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 03:57:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 217 transitions. [2018-04-13 03:57:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 03:57:41,834 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:41,834 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:41,834 INFO L408 AbstractCegarLoop]: === Iteration 174 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1235628261, now seen corresponding path program 16 times [2018-04-13 03:57:41,835 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:41,835 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:41,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:41,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:41,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:41,846 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:41,849 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:41,849 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:41,849 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:41,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:57:41,891 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:57:41,892 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:41,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:41,902 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-13 03:57:41,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:41,906 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-13 03:57:41,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:41,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:41,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:41,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:41,917 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-13 03:57:41,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:41,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:41,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:41,923 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-13 03:57:41,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:41,926 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-13 03:57:41,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:42,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:42,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 03:57:42,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 03:57:42,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 03:57:42,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:57:42,191 INFO L87 Difference]: Start difference. First operand 199 states and 217 transitions. Second operand 25 states. [2018-04-13 03:57:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:43,282 INFO L93 Difference]: Finished difference Result 885 states and 904 transitions. [2018-04-13 03:57:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 03:57:43,282 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-04-13 03:57:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:43,283 INFO L225 Difference]: With dead ends: 885 [2018-04-13 03:57:43,283 INFO L226 Difference]: Without dead ends: 885 [2018-04-13 03:57:43,283 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=1934, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 03:57:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-04-13 03:57:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 203. [2018-04-13 03:57:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-13 03:57:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 221 transitions. [2018-04-13 03:57:43,285 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 221 transitions. Word has length 99 [2018-04-13 03:57:43,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:43,285 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 221 transitions. [2018-04-13 03:57:43,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 03:57:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 221 transitions. [2018-04-13 03:57:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:57:43,286 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:43,286 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:43,286 INFO L408 AbstractCegarLoop]: === Iteration 175 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:43,286 INFO L82 PathProgramCache]: Analyzing trace with hash 50864389, now seen corresponding path program 16 times [2018-04-13 03:57:43,286 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:43,286 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:43,286 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:43,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:43,286 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:43,293 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:43,296 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:43,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:43,296 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:43,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:57:43,313 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:57:43,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:43,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:43,319 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-13 03:57:43,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:43,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:43,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 03:57:43,334 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 03:57:43,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 03:57:43,345 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 2 xjuncts. [2018-04-13 03:57:43,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-04-13 03:57:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:44,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:44,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-13 03:57:44,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 03:57:44,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 03:57:44,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2348, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 03:57:44,756 INFO L87 Difference]: Start difference. First operand 203 states and 221 transitions. Second operand 50 states. [2018-04-13 03:57:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:49,554 INFO L93 Difference]: Finished difference Result 294 states and 312 transitions. [2018-04-13 03:57:49,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 03:57:49,554 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2018-04-13 03:57:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:49,554 INFO L225 Difference]: With dead ends: 294 [2018-04-13 03:57:49,554 INFO L226 Difference]: Without dead ends: 294 [2018-04-13 03:57:49,555 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=386, Invalid=8926, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 03:57:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-04-13 03:57:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 208. [2018-04-13 03:57:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:57:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:57:49,556 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:57:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:49,556 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:57:49,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 03:57:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:57:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:57:49,556 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:49,556 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:49,556 INFO L408 AbstractCegarLoop]: === Iteration 176 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1855538877, now seen corresponding path program 7 times [2018-04-13 03:57:49,556 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:49,557 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:49,557 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:49,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:57:49,557 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:49,565 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:49,570 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:49,570 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:49,570 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:49,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:57:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:49,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:49,594 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-13 03:57:49,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:49,598 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-13 03:57:49,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:49,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:49,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:49,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:49,609 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-13 03:57:49,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:49,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:49,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:49,615 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-13 03:57:49,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:49,618 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-13 03:57:49,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:57:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:57:50,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:57:50,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 03:57:50,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 03:57:50,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 03:57:50,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 03:57:50,401 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 46 states. [2018-04-13 03:57:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:57:52,495 INFO L93 Difference]: Finished difference Result 373 states and 391 transitions. [2018-04-13 03:57:52,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 03:57:52,495 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 104 [2018-04-13 03:57:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:57:52,496 INFO L225 Difference]: With dead ends: 373 [2018-04-13 03:57:52,496 INFO L226 Difference]: Without dead ends: 373 [2018-04-13 03:57:52,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=348, Invalid=7484, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 03:57:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-13 03:57:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 208. [2018-04-13 03:57:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:57:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:57:52,497 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:57:52,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:57:52,498 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:57:52,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 03:57:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:57:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:57:52,498 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:57:52,498 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:57:52,498 INFO L408 AbstractCegarLoop]: === Iteration 177 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:57:52,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1730999692, now seen corresponding path program 106 times [2018-04-13 03:57:52,498 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:57:52,498 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:57:52,499 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:52,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:57:52,499 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:57:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:57:52,505 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:57:52,509 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:57:52,509 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:57:52,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:57:52,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:57:52,528 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:57:52,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:57:52,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:57:52,534 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-13 03:57:52,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:52,538 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-13 03:57:52,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:52,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:57:52,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:57:52,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:52,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:57:52,550 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-13 03:57:52,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:52,555 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-13 03:57:52,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:57:52,558 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-13 03:57:52,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:58:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:02,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:02,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 03:58:02,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 03:58:02,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 03:58:02,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 03:58:02,186 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 43 states. [2018-04-13 03:58:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:05,473 INFO L93 Difference]: Finished difference Result 369 states and 387 transitions. [2018-04-13 03:58:05,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 03:58:05,473 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 104 [2018-04-13 03:58:05,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:05,473 INFO L225 Difference]: With dead ends: 369 [2018-04-13 03:58:05,473 INFO L226 Difference]: Without dead ends: 369 [2018-04-13 03:58:05,474 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=314, Invalid=6328, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 03:58:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-04-13 03:58:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 208. [2018-04-13 03:58:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:05,475 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:05,475 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:05,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 03:58:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:05,476 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:05,476 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:05,476 INFO L408 AbstractCegarLoop]: === Iteration 178 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:05,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1157787555, now seen corresponding path program 107 times [2018-04-13 03:58:05,476 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:05,476 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:05,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:05,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:05,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:05,483 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:05,487 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:05,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:05,487 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:05,487 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:58:05,524 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-04-13 03:58:05,524 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:05,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:05,530 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-13 03:58:05,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:05,534 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-13 03:58:05,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:05,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:05,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:05,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:05,553 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-13 03:58:05,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:05,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:05,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:05,559 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-13 03:58:05,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:05,562 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-13 03:58:05,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:58:05,665 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 5 treesize of output 1 [2018-04-13 03:58:05,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:05,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:05,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-04-13 03:58:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:06,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:06,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-13 03:58:06,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 03:58:06,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 03:58:06,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1804, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 03:58:06,287 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 44 states. [2018-04-13 03:58:08,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:08,299 INFO L93 Difference]: Finished difference Result 444 states and 462 transitions. [2018-04-13 03:58:08,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 03:58:08,299 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 104 [2018-04-13 03:58:08,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:08,299 INFO L225 Difference]: With dead ends: 444 [2018-04-13 03:58:08,299 INFO L226 Difference]: Without dead ends: 444 [2018-04-13 03:58:08,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=324, Invalid=6648, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 03:58:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-04-13 03:58:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 208. [2018-04-13 03:58:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:08,301 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:08,301 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:08,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 03:58:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:08,301 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:08,301 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:08,301 INFO L408 AbstractCegarLoop]: === Iteration 179 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1745829076, now seen corresponding path program 108 times [2018-04-13 03:58:08,301 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:08,301 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:08,302 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:08,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:08,302 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:08,309 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:08,314 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:08,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:08,315 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:08,315 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:58:08,391 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-04-13 03:58:08,391 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:08,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:08,401 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-13 03:58:08,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:08,405 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-13 03:58:08,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:08,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:08,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:08,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:08,416 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-13 03:58:08,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:08,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:08,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:08,423 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 03:58:08,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:08,426 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-13 03:58:08,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:58:08,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-13 03:58:08,462 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 5 treesize of output 1 [2018-04-13 03:58:08,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:08,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:08,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:08,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:11 [2018-04-13 03:58:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:08,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:08,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 03:58:08,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 03:58:08,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 03:58:08,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:58:08,962 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 41 states. [2018-04-13 03:58:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:10,630 INFO L93 Difference]: Finished difference Result 514 states and 532 transitions. [2018-04-13 03:58:10,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 03:58:10,631 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 104 [2018-04-13 03:58:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:10,631 INFO L225 Difference]: With dead ends: 514 [2018-04-13 03:58:10,631 INFO L226 Difference]: Without dead ends: 514 [2018-04-13 03:58:10,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=294, Invalid=5712, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 03:58:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-04-13 03:58:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 208. [2018-04-13 03:58:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:10,633 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:10,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:10,633 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:10,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 03:58:10,633 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:10,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:10,633 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:10,633 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:10,633 INFO L408 AbstractCegarLoop]: === Iteration 180 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash 188521987, now seen corresponding path program 109 times [2018-04-13 03:58:10,633 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:10,634 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:10,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:10,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:10,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:10,642 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:10,644 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:10,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:10,644 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:10,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:58:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:10,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:10,682 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-13 03:58:10,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:10,686 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-13 03:58:10,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:10,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:10,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:10,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:10,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:10,698 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-13 03:58:10,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:10,702 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-13 03:58:10,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:10,706 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-13 03:58:10,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:58:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:11,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:11,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 03:58:11,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 03:58:11,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 03:58:11,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:58:11,380 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 41 states. [2018-04-13 03:58:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:13,343 INFO L93 Difference]: Finished difference Result 579 states and 597 transitions. [2018-04-13 03:58:13,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 03:58:13,343 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 104 [2018-04-13 03:58:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:13,344 INFO L225 Difference]: With dead ends: 579 [2018-04-13 03:58:13,344 INFO L226 Difference]: Without dead ends: 579 [2018-04-13 03:58:13,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=297, Invalid=5865, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 03:58:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-04-13 03:58:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 208. [2018-04-13 03:58:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:13,345 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:13,345 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:13,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 03:58:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:13,346 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:13,346 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:13,346 INFO L408 AbstractCegarLoop]: === Iteration 181 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:13,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1158997812, now seen corresponding path program 110 times [2018-04-13 03:58:13,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:13,346 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:13,346 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:13,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:58:13,346 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:13,354 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:13,356 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:13,356 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:13,356 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:13,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:58:13,378 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:58:13,378 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:13,382 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:13,384 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-13 03:58:13,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:13,387 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-13 03:58:13,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:13,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:13,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:13,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:13,399 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-13 03:58:13,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:13,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:13,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:13,406 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-13 03:58:13,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:13,409 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-13 03:58:13,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:58:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:14,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:14,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-13 03:58:14,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 03:58:14,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 03:58:14,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:58:14,714 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 39 states. [2018-04-13 03:58:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:17,355 INFO L93 Difference]: Finished difference Result 639 states and 657 transitions. [2018-04-13 03:58:17,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 03:58:17,355 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 104 [2018-04-13 03:58:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:17,356 INFO L225 Difference]: With dead ends: 639 [2018-04-13 03:58:17,356 INFO L226 Difference]: Without dead ends: 639 [2018-04-13 03:58:17,356 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=274, Invalid=5128, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 03:58:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-04-13 03:58:17,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 208. [2018-04-13 03:58:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:17,358 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:17,358 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:17,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 03:58:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:17,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:17,358 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:17,358 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:17,358 INFO L408 AbstractCegarLoop]: === Iteration 182 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:17,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1766540387, now seen corresponding path program 111 times [2018-04-13 03:58:17,358 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:17,358 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:17,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:17,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:17,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:17,367 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:17,369 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:17,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:17,369 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:17,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:58:17,446 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-04-13 03:58:17,446 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:17,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:17,454 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-13 03:58:17,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:17,458 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-13 03:58:17,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:17,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:17,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:17,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:17,470 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-13 03:58:17,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:17,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:17,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:17,477 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-13 03:58:17,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:17,480 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-13 03:58:17,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:58:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:18,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:18,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-13 03:58:18,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 03:58:18,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 03:58:18,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:58:18,009 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 39 states. [2018-04-13 03:58:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:19,852 INFO L93 Difference]: Finished difference Result 694 states and 712 transitions. [2018-04-13 03:58:19,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 03:58:19,852 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 104 [2018-04-13 03:58:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:19,852 INFO L225 Difference]: With dead ends: 694 [2018-04-13 03:58:19,852 INFO L226 Difference]: Without dead ends: 694 [2018-04-13 03:58:19,853 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=281, Invalid=5269, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 03:58:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-04-13 03:58:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 208. [2018-04-13 03:58:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:19,854 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:19,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:19,854 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:19,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 03:58:19,854 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:19,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:19,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:19,855 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:19,855 INFO L408 AbstractCegarLoop]: === Iteration 183 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:19,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1629877868, now seen corresponding path program 112 times [2018-04-13 03:58:19,855 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:19,855 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:19,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:19,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:19,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:19,863 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:19,865 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:19,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:19,866 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:19,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:58:19,894 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:58:19,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:19,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:19,902 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-13 03:58:19,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:19,905 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-13 03:58:19,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:19,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:19,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:19,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:19,917 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-13 03:58:19,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:19,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:19,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:19,923 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-13 03:58:19,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:19,926 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-13 03:58:19,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:58:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:20,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:20,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 03:58:20,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 03:58:20,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 03:58:20,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 03:58:20,768 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 37 states. [2018-04-13 03:58:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:23,074 INFO L93 Difference]: Finished difference Result 744 states and 762 transitions. [2018-04-13 03:58:23,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 03:58:23,075 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 104 [2018-04-13 03:58:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:23,075 INFO L225 Difference]: With dead ends: 744 [2018-04-13 03:58:23,075 INFO L226 Difference]: Without dead ends: 744 [2018-04-13 03:58:23,075 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=254, Invalid=4576, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 03:58:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-04-13 03:58:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 208. [2018-04-13 03:58:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:23,077 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:23,077 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:23,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 03:58:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:23,077 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:23,077 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:23,078 INFO L408 AbstractCegarLoop]: === Iteration 184 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:23,078 INFO L82 PathProgramCache]: Analyzing trace with hash -807116093, now seen corresponding path program 113 times [2018-04-13 03:58:23,078 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:23,078 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:23,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:23,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:23,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:23,086 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:23,089 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:23,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:23,089 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:23,089 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:58:23,130 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-04-13 03:58:23,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:23,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:23,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:58:23,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:23,140 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-13 03:58:23,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:23,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:23,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:23,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:23,154 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-13 03:58:23,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:23,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:23,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:23,162 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-13 03:58:23,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:23,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:23,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-13 03:58:23,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:58:23,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:23,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:23,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 03:58:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:23,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:23,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 03:58:23,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 03:58:23,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 03:58:23,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1555, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:58:23,859 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 41 states. [2018-04-13 03:58:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:26,574 INFO L93 Difference]: Finished difference Result 789 states and 807 transitions. [2018-04-13 03:58:26,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 03:58:26,575 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 104 [2018-04-13 03:58:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:26,575 INFO L225 Difference]: With dead ends: 789 [2018-04-13 03:58:26,575 INFO L226 Difference]: Without dead ends: 789 [2018-04-13 03:58:26,575 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=300, Invalid=5862, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 03:58:26,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-04-13 03:58:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 208. [2018-04-13 03:58:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:26,577 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:26,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:26,577 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:26,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 03:58:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:26,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:26,578 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:26,578 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:26,578 INFO L408 AbstractCegarLoop]: === Iteration 185 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:26,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2841612, now seen corresponding path program 114 times [2018-04-13 03:58:26,578 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:26,578 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:26,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:26,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:26,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:26,588 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:26,590 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:26,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:26,591 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:26,591 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:58:26,652 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-04-13 03:58:26,652 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:26,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:26,663 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-13 03:58:26,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:26,666 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-13 03:58:26,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:26,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:26,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:26,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:26,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:26,678 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-13 03:58:26,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:26,683 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-13 03:58:26,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:26,686 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-13 03:58:26,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:58:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 358 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:27,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:27,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 03:58:27,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 03:58:27,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 03:58:27,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:58:27,172 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 36 states. [2018-04-13 03:58:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:28,943 INFO L93 Difference]: Finished difference Result 829 states and 847 transitions. [2018-04-13 03:58:28,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 03:58:28,943 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 104 [2018-04-13 03:58:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:28,944 INFO L225 Difference]: With dead ends: 829 [2018-04-13 03:58:28,944 INFO L226 Difference]: Without dead ends: 829 [2018-04-13 03:58:28,944 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=251, Invalid=4441, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 03:58:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-04-13 03:58:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 208. [2018-04-13 03:58:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:28,946 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:28,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:28,946 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:28,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 03:58:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:28,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:28,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:28,946 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:28,946 INFO L408 AbstractCegarLoop]: === Iteration 186 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:28,947 INFO L82 PathProgramCache]: Analyzing trace with hash -79824605, now seen corresponding path program 115 times [2018-04-13 03:58:28,947 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:28,947 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:28,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:28,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:28,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:28,957 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:28,960 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:28,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:28,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:28,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:58:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:29,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:29,009 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-13 03:58:29,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:29,016 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-13 03:58:29,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:29,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:29,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:29,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:29,028 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-13 03:58:29,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:29,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:29,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:29,034 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-13 03:58:29,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:29,037 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-13 03:58:29,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:58:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:29,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:29,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 03:58:29,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 03:58:29,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 03:58:29,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 03:58:29,476 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 35 states. [2018-04-13 03:58:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:31,081 INFO L93 Difference]: Finished difference Result 864 states and 882 transitions. [2018-04-13 03:58:31,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 03:58:31,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 104 [2018-04-13 03:58:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:31,082 INFO L225 Difference]: With dead ends: 864 [2018-04-13 03:58:31,082 INFO L226 Difference]: Without dead ends: 864 [2018-04-13 03:58:31,082 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=235, Invalid=4055, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 03:58:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-04-13 03:58:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 208. [2018-04-13 03:58:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:31,084 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:31,084 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:31,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 03:58:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:31,084 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:31,084 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:31,084 INFO L408 AbstractCegarLoop]: === Iteration 187 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:31,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1845147220, now seen corresponding path program 116 times [2018-04-13 03:58:31,085 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:31,085 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:31,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:31,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:58:31,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:31,094 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:31,096 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:31,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:31,097 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:31,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:58:31,156 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:58:31,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:31,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:31,164 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-13 03:58:31,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:31,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:58:31,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:31,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:31,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:31,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:31,179 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-13 03:58:31,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:31,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:31,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:31,185 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-13 03:58:31,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:31,188 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-13 03:58:31,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:58:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:31,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:31,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 03:58:31,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 03:58:31,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 03:58:31,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:58:31,742 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 34 states. [2018-04-13 03:58:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:33,714 INFO L93 Difference]: Finished difference Result 894 states and 912 transitions. [2018-04-13 03:58:33,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:58:33,714 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 104 [2018-04-13 03:58:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:33,715 INFO L225 Difference]: With dead ends: 894 [2018-04-13 03:58:33,715 INFO L226 Difference]: Without dead ends: 894 [2018-04-13 03:58:33,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=222, Invalid=3810, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 03:58:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-04-13 03:58:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 208. [2018-04-13 03:58:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:33,717 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:33,717 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:33,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 03:58:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:33,718 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:33,718 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:33,718 INFO L408 AbstractCegarLoop]: === Iteration 188 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1393428355, now seen corresponding path program 117 times [2018-04-13 03:58:33,718 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:33,718 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:33,718 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:33,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:33,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:33,729 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:33,731 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:33,731 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:33,731 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:33,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:58:33,805 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-04-13 03:58:33,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:33,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:33,819 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-13 03:58:33,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:33,823 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-13 03:58:33,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:33,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:33,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:33,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:33,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:33,838 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-13 03:58:33,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:33,843 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-13 03:58:33,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:33,847 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-13 03:58:33,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:58:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:34,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:34,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 03:58:34,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 03:58:34,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 03:58:34,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:58:34,319 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 33 states. [2018-04-13 03:58:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:35,992 INFO L93 Difference]: Finished difference Result 919 states and 937 transitions. [2018-04-13 03:58:35,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:58:35,992 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 104 [2018-04-13 03:58:35,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:35,992 INFO L225 Difference]: With dead ends: 919 [2018-04-13 03:58:35,992 INFO L226 Difference]: Without dead ends: 919 [2018-04-13 03:58:35,993 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=3685, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 03:58:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-04-13 03:58:35,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 208. [2018-04-13 03:58:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:35,994 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:35,994 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:35,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 03:58:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:35,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:35,995 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:35,995 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:35,995 INFO L408 AbstractCegarLoop]: === Iteration 189 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:35,995 INFO L82 PathProgramCache]: Analyzing trace with hash 893239116, now seen corresponding path program 118 times [2018-04-13 03:58:35,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:35,995 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:35,995 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:35,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:35,995 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:36,006 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:36,008 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:36,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:36,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:36,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:58:36,068 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:58:36,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:36,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:36,078 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-13 03:58:36,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:36,081 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-13 03:58:36,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:36,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:36,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:36,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:36,093 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-13 03:58:36,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:36,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:36,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:36,101 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-13 03:58:36,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:36,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:58:36,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:58:36,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 03:58:36,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:36,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:36,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2018-04-13 03:58:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:36,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:36,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 03:58:36,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 03:58:36,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 03:58:36,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=990, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:58:36,600 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 33 states. [2018-04-13 03:58:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:38,654 INFO L93 Difference]: Finished difference Result 939 states and 957 transitions. [2018-04-13 03:58:38,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 03:58:38,654 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 104 [2018-04-13 03:58:38,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:38,654 INFO L225 Difference]: With dead ends: 939 [2018-04-13 03:58:38,655 INFO L226 Difference]: Without dead ends: 939 [2018-04-13 03:58:38,655 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=3570, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 03:58:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-04-13 03:58:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 208. [2018-04-13 03:58:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:38,657 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:38,657 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:38,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 03:58:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:38,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:38,657 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:38,657 INFO L408 AbstractCegarLoop]: === Iteration 190 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:38,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1250594275, now seen corresponding path program 119 times [2018-04-13 03:58:38,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:38,657 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:38,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:38,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:38,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:38,669 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:38,671 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:38,671 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:38,671 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:38,672 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:58:38,829 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-04-13 03:58:38,829 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:38,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:38,841 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-13 03:58:38,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:38,845 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-13 03:58:38,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:38,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:38,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:38,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:38,857 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-13 03:58:38,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:38,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:38,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:38,865 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 17 treesize of output 24 [2018-04-13 03:58:38,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:38,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:58:38,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:58:38,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:58:38,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:39,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:39,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:14 [2018-04-13 03:58:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 0 proven. 538 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:39,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:39,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-13 03:58:39,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 03:58:39,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 03:58:39,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:58:39,390 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 32 states. [2018-04-13 03:58:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:41,504 INFO L93 Difference]: Finished difference Result 954 states and 972 transitions. [2018-04-13 03:58:41,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:58:41,504 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 104 [2018-04-13 03:58:41,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:41,505 INFO L225 Difference]: With dead ends: 954 [2018-04-13 03:58:41,505 INFO L226 Difference]: Without dead ends: 954 [2018-04-13 03:58:41,505 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=211, Invalid=3571, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 03:58:41,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-04-13 03:58:41,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 208. [2018-04-13 03:58:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:41,507 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:41,507 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:41,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 03:58:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:41,508 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:41,508 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:41,508 INFO L408 AbstractCegarLoop]: === Iteration 191 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:41,508 INFO L82 PathProgramCache]: Analyzing trace with hash -857817876, now seen corresponding path program 120 times [2018-04-13 03:58:41,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:41,508 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:41,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:41,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:41,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:41,519 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:41,521 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:41,522 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:41,522 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:41,522 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:58:41,615 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-04-13 03:58:41,615 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:41,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:41,627 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-13 03:58:41,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:41,630 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-13 03:58:41,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:41,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:41,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:41,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:41,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:41,642 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-13 03:58:41,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:41,647 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-13 03:58:41,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:41,650 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-13 03:58:41,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:58:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 0 proven. 604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:41,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:41,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 03:58:41,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 03:58:41,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 03:58:41,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:58:41,992 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 29 states. [2018-04-13 03:58:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:43,394 INFO L93 Difference]: Finished difference Result 965 states and 983 transitions. [2018-04-13 03:58:43,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 03:58:43,395 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 104 [2018-04-13 03:58:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:43,395 INFO L225 Difference]: With dead ends: 965 [2018-04-13 03:58:43,396 INFO L226 Difference]: Without dead ends: 965 [2018-04-13 03:58:43,396 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=2688, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 03:58:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2018-04-13 03:58:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 208. [2018-04-13 03:58:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-13 03:58:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-04-13 03:58:43,398 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 104 [2018-04-13 03:58:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:43,398 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-04-13 03:58:43,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 03:58:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-04-13 03:58:43,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:43,398 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:43,399 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:43,399 INFO L408 AbstractCegarLoop]: === Iteration 192 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:43,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1066824637, now seen corresponding path program 16 times [2018-04-13 03:58:43,399 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:43,399 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:43,399 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:43,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:43,399 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:43,413 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:43,418 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:43,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:43,419 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:43,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:58:43,492 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:58:43,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:43,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:43,506 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-13 03:58:43,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:43,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 6 treesize of output 5 [2018-04-13 03:58:43,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:43,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:43,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:43,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:43,521 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-13 03:58:43,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:43,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:43,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:43,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, 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-13 03:58:43,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:43,530 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-13 03:58:43,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:58:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:43,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:43,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 03:58:43,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:58:43,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:58:43,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:58:43,818 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand 28 states. [2018-04-13 03:58:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:45,120 INFO L93 Difference]: Finished difference Result 978 states and 997 transitions. [2018-04-13 03:58:45,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:58:45,120 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2018-04-13 03:58:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:45,120 INFO L225 Difference]: With dead ends: 978 [2018-04-13 03:58:45,120 INFO L226 Difference]: Without dead ends: 978 [2018-04-13 03:58:45,121 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=2492, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 03:58:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-04-13 03:58:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 209. [2018-04-13 03:58:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-13 03:58:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 228 transitions. [2018-04-13 03:58:45,123 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 228 transitions. Word has length 104 [2018-04-13 03:58:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:45,123 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 228 transitions. [2018-04-13 03:58:45,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:58:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 228 transitions. [2018-04-13 03:58:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:58:45,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:45,124 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:45,124 INFO L408 AbstractCegarLoop]: === Iteration 193 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:45,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1048935267, now seen corresponding path program 17 times [2018-04-13 03:58:45,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:45,124 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:45,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:45,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:45,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:45,136 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:45,139 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:45,139 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:45,139 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:45,139 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:58:45,245 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-13 03:58:45,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:45,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:45,263 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-13 03:58:45,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:45,267 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-13 03:58:45,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:45,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:45,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:45,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:45,279 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-13 03:58:45,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:45,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:45,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:45,287 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-13 03:58:45,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:45,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:58:45,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:58:45,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 03:58:45,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:45,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:45,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2018-04-13 03:58:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:45,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:45,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 03:58:45,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 03:58:45,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 03:58:45,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=648, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:58:45,583 INFO L87 Difference]: Start difference. First operand 209 states and 228 transitions. Second operand 27 states. [2018-04-13 03:58:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:46,944 INFO L93 Difference]: Finished difference Result 980 states and 1000 transitions. [2018-04-13 03:58:46,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 03:58:46,945 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 104 [2018-04-13 03:58:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:46,945 INFO L225 Difference]: With dead ends: 980 [2018-04-13 03:58:46,945 INFO L226 Difference]: Without dead ends: 980 [2018-04-13 03:58:46,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=2205, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 03:58:46,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2018-04-13 03:58:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 213. [2018-04-13 03:58:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-13 03:58:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 232 transitions. [2018-04-13 03:58:46,948 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 232 transitions. Word has length 104 [2018-04-13 03:58:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:46,948 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 232 transitions. [2018-04-13 03:58:46,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 03:58:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 232 transitions. [2018-04-13 03:58:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:58:46,948 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:46,948 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:46,948 INFO L408 AbstractCegarLoop]: === Iteration 194 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:46,948 INFO L82 PathProgramCache]: Analyzing trace with hash -114868952, now seen corresponding path program 17 times [2018-04-13 03:58:46,948 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:46,948 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:46,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:46,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:46,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:46,956 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:46,960 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:46,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:46,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:46,960 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:58:46,993 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-13 03:58:46,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:58:46,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:46,999 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-13 03:58:46,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:47,003 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-13 03:58:47,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:47,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:47,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:47,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:47,014 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-13 03:58:47,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:47,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:47,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:47,024 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 17 treesize of output 24 [2018-04-13 03:58:47,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:47,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:58:47,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 03:58:47,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 03:58:47,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:47,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:47,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2018-04-13 03:58:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:58:48,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:58:48,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 03:58:48,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 03:58:48,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 03:58:48,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 03:58:48,507 INFO L87 Difference]: Start difference. First operand 213 states and 232 transitions. Second operand 46 states. [2018-04-13 03:58:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:58:52,591 INFO L93 Difference]: Finished difference Result 304 states and 323 transitions. [2018-04-13 03:58:52,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 03:58:52,591 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 109 [2018-04-13 03:58:52,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:58:52,591 INFO L225 Difference]: With dead ends: 304 [2018-04-13 03:58:52,591 INFO L226 Difference]: Without dead ends: 304 [2018-04-13 03:58:52,592 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=345, Invalid=7487, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 03:58:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-04-13 03:58:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 218. [2018-04-13 03:58:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:58:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:58:52,593 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:58:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:58:52,593 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:58:52,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 03:58:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:58:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:58:52,593 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:58:52,593 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:58:52,593 INFO L408 AbstractCegarLoop]: === Iteration 195 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:58:52,593 INFO L82 PathProgramCache]: Analyzing trace with hash 893723905, now seen corresponding path program 121 times [2018-04-13 03:58:52,593 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:58:52,594 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:58:52,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:52,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:58:52,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:58:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:52,601 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:58:52,604 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:58:52,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:58:52,604 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:58:52,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:58:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:58:52,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:58:52,634 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-13 03:58:52,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:52,637 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-13 03:58:52,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:52,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:58:52,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:58:52,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:52,648 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-13 03:58:52,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:52,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:52,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:58:52,654 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-13 03:58:52,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:58:52,657 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-13 03:58:52,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:59:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 0 proven. 669 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:11,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:11,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 03:59:11,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 03:59:11,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 03:59:11,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 03:59:11,763 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 45 states. [2018-04-13 03:59:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:59:15,265 INFO L93 Difference]: Finished difference Result 389 states and 408 transitions. [2018-04-13 03:59:15,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 03:59:15,265 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 109 [2018-04-13 03:59:15,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:59:15,265 INFO L225 Difference]: With dead ends: 389 [2018-04-13 03:59:15,265 INFO L226 Difference]: Without dead ends: 389 [2018-04-13 03:59:15,266 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=330, Invalid=6980, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 03:59:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-04-13 03:59:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 218. [2018-04-13 03:59:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:59:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:59:15,267 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:59:15,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:59:15,267 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:59:15,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 03:59:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:59:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:59:15,267 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:59:15,267 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:59:15,267 INFO L408 AbstractCegarLoop]: === Iteration 196 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:59:15,268 INFO L82 PathProgramCache]: Analyzing trace with hash 185295178, now seen corresponding path program 122 times [2018-04-13 03:59:15,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:59:15,268 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:59:15,268 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:15,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:59:15,268 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:15,275 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:59:15,279 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:59:15,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:59:15,279 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:59:15,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:59:15,298 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:59:15,298 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:59:15,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:59:15,305 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-13 03:59:15,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:15,309 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-13 03:59:15,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:15,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:15,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:59:15,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:15,320 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-13 03:59:15,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:15,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:15,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:15,327 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-13 03:59:15,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:15,330 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-13 03:59:15,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:59:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:24,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:24,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-13 03:59:24,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 03:59:24,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 03:59:24,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 03:59:24,424 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 44 states. [2018-04-13 03:59:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:59:27,797 INFO L93 Difference]: Finished difference Result 469 states and 488 transitions. [2018-04-13 03:59:27,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 03:59:27,797 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 109 [2018-04-13 03:59:27,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:59:27,797 INFO L225 Difference]: With dead ends: 469 [2018-04-13 03:59:27,797 INFO L226 Difference]: Without dead ends: 469 [2018-04-13 03:59:27,798 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=320, Invalid=6652, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 03:59:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-04-13 03:59:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 218. [2018-04-13 03:59:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:59:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:59:27,799 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:59:27,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:59:27,799 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:59:27,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 03:59:27,799 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:59:27,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:59:27,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:59:27,800 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:59:27,800 INFO L408 AbstractCegarLoop]: === Iteration 197 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:59:27,800 INFO L82 PathProgramCache]: Analyzing trace with hash -387916959, now seen corresponding path program 123 times [2018-04-13 03:59:27,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:59:27,800 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:59:27,800 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:27,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:59:27,800 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:27,811 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:59:27,815 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:59:27,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:59:27,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:59:27,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:59:27,861 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-04-13 03:59:27,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:59:27,871 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:59:27,872 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-13 03:59:27,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:27,876 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-13 03:59:27,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:27,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:27,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:59:27,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:27,888 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-13 03:59:27,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:27,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:27,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:27,894 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-13 03:59:27,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:27,897 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-13 03:59:27,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:59:28,461 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 11 treesize of output 1 [2018-04-13 03:59:28,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:28,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:28,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-13 03:59:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 0 proven. 541 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:28,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:28,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 03:59:28,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 03:59:28,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 03:59:28,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1977, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 03:59:28,798 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 46 states. [2018-04-13 03:59:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:59:31,286 INFO L93 Difference]: Finished difference Result 544 states and 563 transitions. [2018-04-13 03:59:31,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 03:59:31,286 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 109 [2018-04-13 03:59:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:59:31,287 INFO L225 Difference]: With dead ends: 544 [2018-04-13 03:59:31,287 INFO L226 Difference]: Without dead ends: 544 [2018-04-13 03:59:31,287 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=343, Invalid=7313, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 03:59:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-04-13 03:59:31,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 218. [2018-04-13 03:59:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:59:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:59:31,288 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:59:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:59:31,288 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:59:31,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 03:59:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:59:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:59:31,289 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:59:31,289 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:59:31,289 INFO L408 AbstractCegarLoop]: === Iteration 198 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:59:31,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1003433706, now seen corresponding path program 124 times [2018-04-13 03:59:31,289 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:59:31,289 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:59:31,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:31,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:59:31,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:31,297 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:59:31,300 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:59:31,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:59:31,300 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:59:31,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:59:31,321 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:59:31,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:59:31,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:59:31,327 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-13 03:59:31,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:31,330 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-13 03:59:31,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:31,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:31,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:59:31,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:31,343 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-13 03:59:31,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:31,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:31,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:31,355 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-13 03:59:31,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:31,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:31,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-13 03:59:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:32,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:32,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 03:59:32,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 03:59:32,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 03:59:32,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 03:59:32,006 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 43 states. [2018-04-13 03:59:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:59:34,005 INFO L93 Difference]: Finished difference Result 614 states and 633 transitions. [2018-04-13 03:59:34,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 03:59:34,006 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 109 [2018-04-13 03:59:34,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:59:34,006 INFO L225 Difference]: With dead ends: 614 [2018-04-13 03:59:34,006 INFO L226 Difference]: Without dead ends: 614 [2018-04-13 03:59:34,007 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=314, Invalid=6492, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 03:59:34,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-04-13 03:59:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 218. [2018-04-13 03:59:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:59:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:59:34,008 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:59:34,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:59:34,008 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:59:34,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 03:59:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:59:34,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:59:34,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:59:34,009 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:59:34,009 INFO L408 AbstractCegarLoop]: === Iteration 199 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:59:34,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1357182527, now seen corresponding path program 125 times [2018-04-13 03:59:34,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:59:34,009 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:59:34,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:34,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:59:34,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:34,017 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:59:34,020 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:59:34,020 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:59:34,020 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:59:34,020 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:59:34,059 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-04-13 03:59:34,059 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:59:34,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:59:34,065 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-13 03:59:34,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:34,069 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-13 03:59:34,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:34,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:34,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:59:34,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:34,085 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-13 03:59:34,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:34,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:34,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:34,091 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-13 03:59:34,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:34,094 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-13 03:59:34,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:59:34,713 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 5 treesize of output 1 [2018-04-13 03:59:34,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:34,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:34,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:16 [2018-04-13 03:59:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:34,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:34,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 03:59:34,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 03:59:34,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 03:59:34,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1720, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 03:59:34,838 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 43 states. [2018-04-13 03:59:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:59:37,206 INFO L93 Difference]: Finished difference Result 679 states and 698 transitions. [2018-04-13 03:59:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 03:59:37,206 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 109 [2018-04-13 03:59:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:59:37,207 INFO L225 Difference]: With dead ends: 679 [2018-04-13 03:59:37,207 INFO L226 Difference]: Without dead ends: 679 [2018-04-13 03:59:37,207 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=312, Invalid=6330, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 03:59:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-04-13 03:59:37,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 218. [2018-04-13 03:59:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:59:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:59:37,209 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:59:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:59:37,209 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:59:37,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 03:59:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:59:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:59:37,209 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:59:37,209 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:59:37,209 INFO L408 AbstractCegarLoop]: === Iteration 200 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:59:37,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1590264970, now seen corresponding path program 126 times [2018-04-13 03:59:37,209 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:59:37,209 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:59:37,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:37,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:59:37,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:37,218 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:59:37,220 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:59:37,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:59:37,221 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:59:37,221 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:59:37,272 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-04-13 03:59:37,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:59:37,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:59:37,280 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-13 03:59:37,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:37,283 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-13 03:59:37,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:37,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:37,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:59:37,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:37,294 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-13 03:59:37,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:37,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:37,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:37,301 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-13 03:59:37,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:37,304 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-13 03:59:37,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:59:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:37,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:37,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 03:59:37,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 03:59:37,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 03:59:37,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:59:37,896 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 41 states. [2018-04-13 03:59:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:59:39,907 INFO L93 Difference]: Finished difference Result 739 states and 758 transitions. [2018-04-13 03:59:39,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 03:59:39,907 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 109 [2018-04-13 03:59:39,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:59:39,908 INFO L225 Difference]: With dead ends: 739 [2018-04-13 03:59:39,908 INFO L226 Difference]: Without dead ends: 739 [2018-04-13 03:59:39,908 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=297, Invalid=5865, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 03:59:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-04-13 03:59:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 218. [2018-04-13 03:59:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:59:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:59:39,910 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:59:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:59:39,910 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:59:39,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 03:59:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:59:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:59:39,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:59:39,910 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:59:39,910 INFO L408 AbstractCegarLoop]: === Iteration 201 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:59:39,910 INFO L82 PathProgramCache]: Analyzing trace with hash 220835873, now seen corresponding path program 127 times [2018-04-13 03:59:39,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:59:39,910 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:59:39,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:39,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:59:39,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:39,919 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:59:39,922 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:59:39,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:59:39,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:59:39,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:59:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:39,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:59:39,957 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-13 03:59:39,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:39,960 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-13 03:59:39,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:39,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:39,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:59:39,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:39,972 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-13 03:59:39,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:39,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:39,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:39,978 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-13 03:59:39,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:39,981 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-13 03:59:39,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:59:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:40,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:40,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 03:59:40,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 03:59:40,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 03:59:40,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 03:59:40,542 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 40 states. [2018-04-13 03:59:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:59:42,420 INFO L93 Difference]: Finished difference Result 794 states and 813 transitions. [2018-04-13 03:59:42,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 03:59:42,420 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 109 [2018-04-13 03:59:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:59:42,421 INFO L225 Difference]: With dead ends: 794 [2018-04-13 03:59:42,421 INFO L226 Difference]: Without dead ends: 794 [2018-04-13 03:59:42,421 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=281, Invalid=5419, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 03:59:42,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-04-13 03:59:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 218. [2018-04-13 03:59:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:59:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:59:42,423 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:59:42,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:59:42,423 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:59:42,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 03:59:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:59:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:59:42,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:59:42,423 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:59:42,424 INFO L408 AbstractCegarLoop]: === Iteration 202 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:59:42,424 INFO L82 PathProgramCache]: Analyzing trace with hash 84173354, now seen corresponding path program 128 times [2018-04-13 03:59:42,424 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:59:42,424 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:59:42,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:42,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:59:42,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:42,433 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:59:42,435 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:59:42,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:59:42,436 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:59:42,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:59:42,462 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:59:42,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:59:42,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:59:42,471 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-13 03:59:42,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:42,474 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-13 03:59:42,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:42,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:42,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:59:42,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:42,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:42,485 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-13 03:59:42,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:42,490 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-13 03:59:42,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:42,493 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-13 03:59:42,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:59:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:43,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:43,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-13 03:59:43,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 03:59:43,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 03:59:43,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:59:43,417 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 39 states. [2018-04-13 03:59:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:59:46,078 INFO L93 Difference]: Finished difference Result 844 states and 863 transitions. [2018-04-13 03:59:46,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 03:59:46,078 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 109 [2018-04-13 03:59:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:59:46,079 INFO L225 Difference]: With dead ends: 844 [2018-04-13 03:59:46,079 INFO L226 Difference]: Without dead ends: 844 [2018-04-13 03:59:46,079 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=268, Invalid=5134, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 03:59:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-04-13 03:59:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 218. [2018-04-13 03:59:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:59:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:59:46,081 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:59:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:59:46,081 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:59:46,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 03:59:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:59:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:59:46,081 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:59:46,081 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:59:46,082 INFO L408 AbstractCegarLoop]: === Iteration 203 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:59:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1942146689, now seen corresponding path program 129 times [2018-04-13 03:59:46,082 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:59:46,082 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:59:46,082 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:46,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:59:46,082 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:46,091 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:59:46,093 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:59:46,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:59:46,094 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:59:46,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:59:46,143 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-13 03:59:46,143 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:59:46,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:59:46,161 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-13 03:59:46,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:46,164 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-13 03:59:46,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:46,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:46,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:59:46,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:46,176 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-13 03:59:46,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:46,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:46,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:46,189 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-13 03:59:46,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:46,192 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-13 03:59:46,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:59:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:46,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:46,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 03:59:46,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 03:59:46,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 03:59:46,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:59:46,724 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 38 states. [2018-04-13 03:59:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:59:48,672 INFO L93 Difference]: Finished difference Result 889 states and 908 transitions. [2018-04-13 03:59:48,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 03:59:48,673 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2018-04-13 03:59:48,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:59:48,673 INFO L225 Difference]: With dead ends: 889 [2018-04-13 03:59:48,673 INFO L226 Difference]: Without dead ends: 889 [2018-04-13 03:59:48,674 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=263, Invalid=4993, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 03:59:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2018-04-13 03:59:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 218. [2018-04-13 03:59:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:59:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:59:48,675 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:59:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:59:48,675 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:59:48,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 03:59:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:59:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:59:48,676 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:59:48,676 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:59:48,676 INFO L408 AbstractCegarLoop]: === Iteration 204 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:59:48,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1542862902, now seen corresponding path program 130 times [2018-04-13 03:59:48,676 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:59:48,676 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:59:48,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:48,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:59:48,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:48,686 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:59:48,688 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:59:48,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:59:48,688 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:59:48,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:59:48,728 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:59:48,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:59:48,735 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:59:48,737 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-13 03:59:48,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:48,741 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-13 03:59:48,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:48,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:48,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:59:48,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:48,755 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-13 03:59:48,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:48,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:48,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:48,763 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-13 03:59:48,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:48,767 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-13 03:59:48,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:59:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:49,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:49,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 03:59:49,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 03:59:49,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 03:59:49,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:59:49,445 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 36 states. [2018-04-13 03:59:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:59:51,628 INFO L93 Difference]: Finished difference Result 929 states and 948 transitions. [2018-04-13 03:59:51,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 03:59:51,628 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2018-04-13 03:59:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:59:51,629 INFO L225 Difference]: With dead ends: 929 [2018-04-13 03:59:51,629 INFO L226 Difference]: Without dead ends: 929 [2018-04-13 03:59:51,629 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=240, Invalid=4316, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 03:59:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-04-13 03:59:51,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 218. [2018-04-13 03:59:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:59:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:59:51,631 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:59:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:59:51,631 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:59:51,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 03:59:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:59:51,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:59:51,631 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:59:51,631 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:59:51,631 INFO L408 AbstractCegarLoop]: === Iteration 205 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:59:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1625529119, now seen corresponding path program 131 times [2018-04-13 03:59:51,631 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:59:51,631 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:59:51,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:51,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:59:51,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:51,642 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:59:51,644 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:59:51,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:59:51,644 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:59:51,645 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:59:51,706 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 03:59:51,706 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:59:51,715 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:59:51,717 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-13 03:59:51,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:51,720 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-13 03:59:51,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:51,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:51,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:59:51,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:51,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 03:59:51,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:51,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:51,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:51,738 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-13 03:59:51,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:51,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:51,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-13 03:59:51,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 03:59:51,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:51,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:51,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:14 [2018-04-13 03:59:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:52,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:52,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-13 03:59:52,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 03:59:52,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 03:59:52,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1403, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:59:52,342 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 39 states. [2018-04-13 03:59:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:59:54,708 INFO L93 Difference]: Finished difference Result 964 states and 983 transitions. [2018-04-13 03:59:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 03:59:54,708 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 109 [2018-04-13 03:59:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:59:54,709 INFO L225 Difference]: With dead ends: 964 [2018-04-13 03:59:54,709 INFO L226 Difference]: Without dead ends: 964 [2018-04-13 03:59:54,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=279, Invalid=5421, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 03:59:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-04-13 03:59:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 218. [2018-04-13 03:59:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:59:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:59:54,711 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:59:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:59:54,711 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:59:54,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 03:59:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:59:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:59:54,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:59:54,711 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:59:54,711 INFO L408 AbstractCegarLoop]: === Iteration 206 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:59:54,711 INFO L82 PathProgramCache]: Analyzing trace with hash 904115562, now seen corresponding path program 132 times [2018-04-13 03:59:54,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:59:54,711 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:59:54,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:54,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:59:54,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:54,722 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:59:54,724 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:59:54,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:59:54,724 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:59:54,725 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:59:54,800 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-13 03:59:54,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:59:54,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:59:54,810 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-13 03:59:54,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:54,816 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-13 03:59:54,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:54,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:54,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:59:54,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:54,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:54,827 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-13 03:59:54,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:54,832 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-13 03:59:54,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:54,835 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-13 03:59:54,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:59:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:55,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:55,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 03:59:55,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 03:59:55,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 03:59:55,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:59:55,251 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 34 states. [2018-04-13 03:59:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:59:56,913 INFO L93 Difference]: Finished difference Result 994 states and 1013 transitions. [2018-04-13 03:59:56,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:59:56,913 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 109 [2018-04-13 03:59:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:59:56,913 INFO L225 Difference]: With dead ends: 994 [2018-04-13 03:59:56,913 INFO L226 Difference]: Without dead ends: 994 [2018-04-13 03:59:56,914 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=3812, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 03:59:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-04-13 03:59:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 218. [2018-04-13 03:59:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:59:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:59:56,916 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:59:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:59:56,916 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:59:56,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 03:59:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:59:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:59:56,916 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:59:56,916 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:59:56,916 INFO L408 AbstractCegarLoop]: === Iteration 207 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:59:56,916 INFO L82 PathProgramCache]: Analyzing trace with hash -152276159, now seen corresponding path program 133 times [2018-04-13 03:59:56,916 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:59:56,916 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:59:56,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:56,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:59:56,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:56,927 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:59:56,929 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:59:56,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:59:56,929 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:59:56,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:59:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:56,973 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:59:56,974 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-13 03:59:56,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:56,978 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-13 03:59:56,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:56,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:56,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:59:56,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:56,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:56,990 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-13 03:59:56,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:56,994 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-13 03:59:56,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:56,998 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-13 03:59:56,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:59:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:57,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:57,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 03:59:57,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 03:59:57,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 03:59:57,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:59:57,412 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 34 states. [2018-04-13 03:59:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:59:59,083 INFO L93 Difference]: Finished difference Result 1019 states and 1038 transitions. [2018-04-13 03:59:59,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:59:59,084 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 109 [2018-04-13 03:59:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:59:59,084 INFO L225 Difference]: With dead ends: 1019 [2018-04-13 03:59:59,084 INFO L226 Difference]: Without dead ends: 1019 [2018-04-13 03:59:59,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=3813, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 03:59:59,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-04-13 03:59:59,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 218. [2018-04-13 03:59:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 03:59:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 03:59:59,087 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 03:59:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:59:59,087 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 03:59:59,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 03:59:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 03:59:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 03:59:59,088 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:59:59,088 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:59:59,088 INFO L408 AbstractCegarLoop]: === Iteration 208 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:59:59,088 INFO L82 PathProgramCache]: Analyzing trace with hash -652465398, now seen corresponding path program 134 times [2018-04-13 03:59:59,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:59:59,088 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:59:59,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:59,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:59:59,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:59:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:59:59,108 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:59:59,112 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:59:59,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:59:59,112 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:59:59,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:59:59,153 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:59:59,153 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:59:59,161 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:59:59,163 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-13 03:59:59,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:59,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:59:59,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:59,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:59,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:59:59,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:59,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:59:59,178 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-13 03:59:59,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:59,182 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-13 03:59:59,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:59,186 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-13 03:59:59,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 03:59:59,289 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 11 treesize of output 1 [2018-04-13 03:59:59,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:59:59,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:59:59,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:11 [2018-04-13 03:59:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:59:59,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:59:59,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 03:59:59,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 03:59:59,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 03:59:59,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:59:59,711 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 34 states. [2018-04-13 04:00:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:01,873 INFO L93 Difference]: Finished difference Result 1039 states and 1058 transitions. [2018-04-13 04:00:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 04:00:01,873 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 109 [2018-04-13 04:00:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:01,874 INFO L225 Difference]: With dead ends: 1039 [2018-04-13 04:00:01,874 INFO L226 Difference]: Without dead ends: 1039 [2018-04-13 04:00:01,874 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=222, Invalid=3938, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 04:00:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2018-04-13 04:00:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 218. [2018-04-13 04:00:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 04:00:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 04:00:01,876 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 04:00:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:01,876 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 04:00:01,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 04:00:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 04:00:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 04:00:01,877 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:01,877 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:01,877 INFO L408 AbstractCegarLoop]: === Iteration 209 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:01,877 INFO L82 PathProgramCache]: Analyzing trace with hash -295110239, now seen corresponding path program 135 times [2018-04-13 04:00:01,877 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:01,877 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:01,877 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:01,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:01,877 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:01,889 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:01,892 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:01,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:01,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:01,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:00:01,972 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-13 04:00:01,973 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:01,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:01,992 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-13 04:00:01,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:01,995 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-13 04:00:01,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:01,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:01,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:02,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:02,006 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-13 04:00:02,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:02,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:02,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:02,013 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-13 04:00:02,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:02,016 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-13 04:00:02,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:00:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 613 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:02,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:02,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 04:00:02,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 04:00:02,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 04:00:02,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-13 04:00:02,398 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 31 states. [2018-04-13 04:00:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:04,124 INFO L93 Difference]: Finished difference Result 1054 states and 1073 transitions. [2018-04-13 04:00:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 04:00:04,125 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 109 [2018-04-13 04:00:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:04,125 INFO L225 Difference]: With dead ends: 1054 [2018-04-13 04:00:04,125 INFO L226 Difference]: Without dead ends: 1054 [2018-04-13 04:00:04,126 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=3116, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 04:00:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2018-04-13 04:00:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 218. [2018-04-13 04:00:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 04:00:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 04:00:04,128 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 04:00:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:04,129 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 04:00:04,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 04:00:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 04:00:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 04:00:04,129 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:04,129 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:04,129 INFO L408 AbstractCegarLoop]: === Iteration 210 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1891444906, now seen corresponding path program 136 times [2018-04-13 04:00:04,130 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:04,130 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:04,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:04,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:04,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:04,152 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:04,157 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:04,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:04,157 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:04,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:00:04,215 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:00:04,215 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:04,225 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:04,227 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-13 04:00:04,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:04,231 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-13 04:00:04,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:04,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:04,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:04,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:04,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:04,252 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-13 04:00:04,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:04,256 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-13 04:00:04,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:04,260 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-13 04:00:04,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:00:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:04,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:04,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-13 04:00:04,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 04:00:04,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 04:00:04,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-04-13 04:00:04,603 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 30 states. [2018-04-13 04:00:06,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:06,203 INFO L93 Difference]: Finished difference Result 1065 states and 1084 transitions. [2018-04-13 04:00:06,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 04:00:06,203 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 109 [2018-04-13 04:00:06,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:06,204 INFO L225 Difference]: With dead ends: 1065 [2018-04-13 04:00:06,204 INFO L226 Difference]: Without dead ends: 1065 [2018-04-13 04:00:06,204 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=2904, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 04:00:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-04-13 04:00:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 218. [2018-04-13 04:00:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 04:00:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-04-13 04:00:06,207 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 109 [2018-04-13 04:00:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:06,207 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-04-13 04:00:06,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 04:00:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-04-13 04:00:06,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 04:00:06,207 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:06,207 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:06,207 INFO L408 AbstractCegarLoop]: === Iteration 211 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:06,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1682438145, now seen corresponding path program 17 times [2018-04-13 04:00:06,207 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:06,207 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:06,208 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:06,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:06,208 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:06,223 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:06,228 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:06,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:06,229 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:06,229 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:00:06,341 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-13 04:00:06,341 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:06,353 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:06,355 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-13 04:00:06,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:06,358 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-13 04:00:06,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:06,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:06,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:06,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:06,370 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-13 04:00:06,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:06,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:06,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:06,378 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-13 04:00:06,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:06,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:00:06,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 04:00:06,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 04:00:06,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:06,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:06,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 04:00:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:06,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:06,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 04:00:06,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 04:00:06,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 04:00:06,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-04-13 04:00:06,788 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 29 states. [2018-04-13 04:00:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:08,477 INFO L93 Difference]: Finished difference Result 1078 states and 1098 transitions. [2018-04-13 04:00:08,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 04:00:08,477 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2018-04-13 04:00:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:08,478 INFO L225 Difference]: With dead ends: 1078 [2018-04-13 04:00:08,478 INFO L226 Difference]: Without dead ends: 1078 [2018-04-13 04:00:08,478 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=2695, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 04:00:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2018-04-13 04:00:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 219. [2018-04-13 04:00:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-13 04:00:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 239 transitions. [2018-04-13 04:00:08,480 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 239 transitions. Word has length 109 [2018-04-13 04:00:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:08,480 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 239 transitions. [2018-04-13 04:00:08,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 04:00:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 239 transitions. [2018-04-13 04:00:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 04:00:08,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:08,481 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:08,481 INFO L408 AbstractCegarLoop]: === Iteration 212 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:08,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1700327515, now seen corresponding path program 18 times [2018-04-13 04:00:08,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:08,481 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:08,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:08,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:08,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:08,494 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:08,497 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:08,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:08,497 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:08,497 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:00:08,616 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-13 04:00:08,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:08,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:08,633 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-13 04:00:08,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:08,636 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-13 04:00:08,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:08,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:08,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:08,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:08,648 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-13 04:00:08,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:08,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:08,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:08,654 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-13 04:00:08,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:08,657 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-13 04:00:08,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:00:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:08,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:08,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 04:00:08,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 04:00:08,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 04:00:08,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:00:08,928 INFO L87 Difference]: Start difference. First operand 219 states and 239 transitions. Second operand 27 states. [2018-04-13 04:00:10,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:10,185 INFO L93 Difference]: Finished difference Result 1080 states and 1101 transitions. [2018-04-13 04:00:10,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 04:00:10,186 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 109 [2018-04-13 04:00:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:10,186 INFO L225 Difference]: With dead ends: 1080 [2018-04-13 04:00:10,186 INFO L226 Difference]: Without dead ends: 1080 [2018-04-13 04:00:10,187 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=2302, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 04:00:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2018-04-13 04:00:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 223. [2018-04-13 04:00:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-13 04:00:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 243 transitions. [2018-04-13 04:00:10,189 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 243 transitions. Word has length 109 [2018-04-13 04:00:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:10,189 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 243 transitions. [2018-04-13 04:00:10,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 04:00:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 243 transitions. [2018-04-13 04:00:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:00:10,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:10,190 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:10,190 INFO L408 AbstractCegarLoop]: === Iteration 213 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:10,190 INFO L82 PathProgramCache]: Analyzing trace with hash 30621413, now seen corresponding path program 18 times [2018-04-13 04:00:10,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:10,190 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:10,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:10,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:10,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:10,198 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:10,203 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:10,204 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:10,204 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:10,204 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:00:10,265 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-13 04:00:10,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:10,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:10,274 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-13 04:00:10,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:10,278 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-13 04:00:10,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:10,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:10,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:10,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:10,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:10,291 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-13 04:00:10,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:10,295 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-13 04:00:10,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:10,298 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-13 04:00:10,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:00:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:11,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:11,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-13 04:00:11,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-13 04:00:11,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-13 04:00:11,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 04:00:11,181 INFO L87 Difference]: Start difference. First operand 223 states and 243 transitions. Second operand 49 states. [2018-04-13 04:00:13,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:13,428 INFO L93 Difference]: Finished difference Result 319 states and 339 transitions. [2018-04-13 04:00:13,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 04:00:13,429 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 114 [2018-04-13 04:00:13,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:13,429 INFO L225 Difference]: With dead ends: 319 [2018-04-13 04:00:13,429 INFO L226 Difference]: Without dead ends: 319 [2018-04-13 04:00:13,429 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=373, Invalid=8557, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 04:00:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-13 04:00:13,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 228. [2018-04-13 04:00:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:00:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:00:13,431 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:00:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:13,431 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:00:13,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-13 04:00:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:00:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:00:13,431 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:13,431 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:13,431 INFO L408 AbstractCegarLoop]: === Iteration 214 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1905874604, now seen corresponding path program 137 times [2018-04-13 04:00:13,431 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:13,431 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:13,432 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:13,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:13,432 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:13,440 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:13,445 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:13,446 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:13,446 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:13,446 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:00:13,492 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-13 04:00:13,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:13,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:13,500 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-13 04:00:13,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:13,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:00:13,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:13,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:13,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:13,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:13,524 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-13 04:00:13,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:13,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:13,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:13,533 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-13 04:00:13,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:13,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:00:13,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 04:00:15,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 04:00:15,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:15,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:15,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:111, output treesize:97 [2018-04-13 04:00:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 0 proven. 753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:15,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:15,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-13 04:00:15,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 04:00:15,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 04:00:15,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 04:00:15,771 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 50 states. [2018-04-13 04:00:21,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:21,772 INFO L93 Difference]: Finished difference Result 409 states and 429 transitions. [2018-04-13 04:00:21,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 04:00:21,772 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 114 [2018-04-13 04:00:21,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:21,773 INFO L225 Difference]: With dead ends: 409 [2018-04-13 04:00:21,773 INFO L226 Difference]: Without dead ends: 409 [2018-04-13 04:00:21,773 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=392, Invalid=9310, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 04:00:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-04-13 04:00:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 228. [2018-04-13 04:00:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:00:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:00:21,775 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:00:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:21,775 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:00:21,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 04:00:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:00:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:00:21,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:21,775 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:21,775 INFO L408 AbstractCegarLoop]: === Iteration 215 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:21,775 INFO L82 PathProgramCache]: Analyzing trace with hash 652894211, now seen corresponding path program 138 times [2018-04-13 04:00:21,775 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:21,775 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:21,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:21,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:21,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:21,784 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:21,789 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:21,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:21,789 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:21,789 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:00:21,829 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-04-13 04:00:21,829 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:21,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:21,838 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-13 04:00:21,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:21,841 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-13 04:00:21,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:21,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:21,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:21,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:21,852 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-13 04:00:21,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:21,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:21,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:21,859 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-13 04:00:21,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:21,862 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-13 04:00:21,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:00:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:22,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:22,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 04:00:22,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 04:00:22,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 04:00:22,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 04:00:22,590 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 46 states. [2018-04-13 04:00:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:24,704 INFO L93 Difference]: Finished difference Result 494 states and 514 transitions. [2018-04-13 04:00:24,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 04:00:24,704 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 114 [2018-04-13 04:00:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:24,704 INFO L225 Difference]: With dead ends: 494 [2018-04-13 04:00:24,705 INFO L226 Difference]: Without dead ends: 494 [2018-04-13 04:00:24,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=336, Invalid=7320, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 04:00:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-04-13 04:00:24,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 228. [2018-04-13 04:00:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:00:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:00:24,706 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:00:24,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:24,707 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:00:24,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 04:00:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:00:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:00:24,707 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:24,707 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:24,707 INFO L408 AbstractCegarLoop]: === Iteration 216 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash -55534516, now seen corresponding path program 139 times [2018-04-13 04:00:24,707 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:24,707 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:24,708 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:24,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:24,708 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:24,716 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:24,722 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:24,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:24,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:24,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:00:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:24,749 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:24,751 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-13 04:00:24,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:24,754 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-13 04:00:24,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:24,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:24,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:24,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:24,770 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-13 04:00:24,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:24,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:24,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:24,776 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-13 04:00:24,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:24,779 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-13 04:00:24,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:00:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 615 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:25,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:25,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 04:00:25,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 04:00:25,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 04:00:25,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 04:00:25,481 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 45 states. [2018-04-13 04:00:27,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:27,564 INFO L93 Difference]: Finished difference Result 574 states and 594 transitions. [2018-04-13 04:00:27,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 04:00:27,565 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 114 [2018-04-13 04:00:27,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:27,565 INFO L225 Difference]: With dead ends: 574 [2018-04-13 04:00:27,565 INFO L226 Difference]: Without dead ends: 574 [2018-04-13 04:00:27,566 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=326, Invalid=6984, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 04:00:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-04-13 04:00:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 228. [2018-04-13 04:00:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:00:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:00:27,567 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:00:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:27,567 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:00:27,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 04:00:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:00:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:00:27,568 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:27,568 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:27,568 INFO L408 AbstractCegarLoop]: === Iteration 217 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:27,568 INFO L82 PathProgramCache]: Analyzing trace with hash -628746653, now seen corresponding path program 140 times [2018-04-13 04:00:27,568 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:27,568 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:27,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:27,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:00:27,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:27,577 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:27,581 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:27,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:27,581 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:27,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:00:27,635 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:00:27,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:27,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:27,643 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-13 04:00:27,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:27,647 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-13 04:00:27,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:27,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:27,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:27,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:27,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:27,660 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-13 04:00:27,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:27,667 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-13 04:00:27,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:27,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:27,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-13 04:00:27,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:00:27,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:27,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:27,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:19 [2018-04-13 04:00:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:32,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:32,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 04:00:32,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 04:00:32,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 04:00:32,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1978, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 04:00:32,779 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 46 states. [2018-04-13 04:00:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:36,749 INFO L93 Difference]: Finished difference Result 649 states and 669 transitions. [2018-04-13 04:00:36,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 04:00:36,749 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 114 [2018-04-13 04:00:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:36,749 INFO L225 Difference]: With dead ends: 649 [2018-04-13 04:00:36,750 INFO L226 Difference]: Without dead ends: 649 [2018-04-13 04:00:36,750 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=337, Invalid=7495, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 04:00:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-04-13 04:00:36,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 228. [2018-04-13 04:00:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:00:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:00:36,752 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:00:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:36,752 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:00:36,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 04:00:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:00:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:00:36,752 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:36,752 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:36,752 INFO L408 AbstractCegarLoop]: === Iteration 218 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:36,752 INFO L82 PathProgramCache]: Analyzing trace with hash 762604012, now seen corresponding path program 141 times [2018-04-13 04:00:36,752 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:36,752 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:36,753 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:36,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:36,753 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:36,762 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:36,764 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:36,764 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:36,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:36,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:00:36,850 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-04-13 04:00:36,850 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:36,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:36,864 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-13 04:00:36,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:36,867 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-13 04:00:36,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:36,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:36,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:36,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:36,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:36,887 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-13 04:00:36,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:36,891 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-13 04:00:36,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:36,894 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-13 04:00:36,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:00:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 0 proven. 517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:37,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:37,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 04:00:37,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 04:00:37,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 04:00:37,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 04:00:37,530 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 43 states. [2018-04-13 04:00:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:39,588 INFO L93 Difference]: Finished difference Result 719 states and 739 transitions. [2018-04-13 04:00:39,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 04:00:39,588 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 114 [2018-04-13 04:00:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:39,589 INFO L225 Difference]: With dead ends: 719 [2018-04-13 04:00:39,589 INFO L226 Difference]: Without dead ends: 719 [2018-04-13 04:00:39,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=306, Invalid=6336, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 04:00:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-04-13 04:00:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 228. [2018-04-13 04:00:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:00:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:00:39,591 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:00:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:39,591 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:00:39,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 04:00:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:00:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:00:39,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:39,592 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:39,592 INFO L408 AbstractCegarLoop]: === Iteration 219 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:39,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1598012221, now seen corresponding path program 142 times [2018-04-13 04:00:39,592 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:39,592 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:39,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:39,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:39,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:39,602 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:39,605 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:39,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:39,605 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:39,605 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:00:39,641 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:00:39,641 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:39,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:39,649 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-13 04:00:39,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:39,653 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-13 04:00:39,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:39,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:39,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:39,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:39,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:39,664 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-13 04:00:39,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:39,669 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-13 04:00:39,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:39,672 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-13 04:00:39,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:00:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:41,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:41,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-13 04:00:41,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-13 04:00:41,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-13 04:00:41,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 04:00:41,639 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 42 states. [2018-04-13 04:00:44,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:44,790 INFO L93 Difference]: Finished difference Result 784 states and 804 transitions. [2018-04-13 04:00:44,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 04:00:44,790 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 114 [2018-04-13 04:00:44,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:44,791 INFO L225 Difference]: With dead ends: 784 [2018-04-13 04:00:44,791 INFO L226 Difference]: Without dead ends: 784 [2018-04-13 04:00:44,791 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=296, Invalid=6024, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 04:00:44,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-04-13 04:00:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 228. [2018-04-13 04:00:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:00:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:00:44,793 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:00:44,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:44,793 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:00:44,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-13 04:00:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:00:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:00:44,794 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:44,794 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:44,794 INFO L408 AbstractCegarLoop]: === Iteration 220 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1349435276, now seen corresponding path program 143 times [2018-04-13 04:00:44,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:44,794 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:44,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:44,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:44,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:44,804 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:44,806 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:44,807 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:44,807 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:44,807 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:00:44,852 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 04:00:44,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:44,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:44,859 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-13 04:00:44,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:44,863 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-13 04:00:44,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:44,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:44,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:44,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:44,875 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-13 04:00:44,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:44,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:44,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:44,882 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-13 04:00:44,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:44,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:00:44,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 04:00:45,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:00:45,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:45,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:45,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:11 [2018-04-13 04:00:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:45,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:45,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 04:00:45,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 04:00:45,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 04:00:45,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1720, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 04:00:45,764 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 43 states. [2018-04-13 04:00:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:48,862 INFO L93 Difference]: Finished difference Result 844 states and 864 transitions. [2018-04-13 04:00:48,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 04:00:48,863 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 114 [2018-04-13 04:00:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:48,863 INFO L225 Difference]: With dead ends: 844 [2018-04-13 04:00:48,863 INFO L226 Difference]: Without dead ends: 844 [2018-04-13 04:00:48,864 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=311, Invalid=6495, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 04:00:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-04-13 04:00:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 228. [2018-04-13 04:00:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:00:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:00:48,865 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:00:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:48,866 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:00:48,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 04:00:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:00:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:00:48,866 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:48,866 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:48,866 INFO L408 AbstractCegarLoop]: === Iteration 221 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:48,866 INFO L82 PathProgramCache]: Analyzing trace with hash -19993821, now seen corresponding path program 144 times [2018-04-13 04:00:48,866 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:48,866 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:48,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:48,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:48,867 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:48,876 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:48,878 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:48,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:48,878 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:48,879 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:00:48,945 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-04-13 04:00:48,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:48,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:48,956 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-13 04:00:48,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:48,960 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-13 04:00:48,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:48,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:48,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:48,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:48,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:48,970 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-13 04:00:48,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:48,975 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-13 04:00:48,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:48,979 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-13 04:00:48,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:00:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:49,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:49,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 04:00:49,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 04:00:49,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 04:00:49,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:00:49,553 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 40 states. [2018-04-13 04:00:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:51,680 INFO L93 Difference]: Finished difference Result 899 states and 919 transitions. [2018-04-13 04:00:51,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 04:00:51,680 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 114 [2018-04-13 04:00:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:51,681 INFO L225 Difference]: With dead ends: 899 [2018-04-13 04:00:51,681 INFO L226 Difference]: Without dead ends: 899 [2018-04-13 04:00:51,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=276, Invalid=5424, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 04:00:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-04-13 04:00:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 228. [2018-04-13 04:00:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:00:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:00:51,683 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:00:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:51,683 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:00:51,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 04:00:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:00:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:00:51,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:51,683 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:51,683 INFO L408 AbstractCegarLoop]: === Iteration 222 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:51,684 INFO L82 PathProgramCache]: Analyzing trace with hash -156656340, now seen corresponding path program 145 times [2018-04-13 04:00:51,684 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:51,684 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:51,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:51,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:51,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:51,693 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:51,696 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:51,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:51,696 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:51,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:00:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:51,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:51,737 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-13 04:00:51,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:51,741 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-13 04:00:51,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:51,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:51,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:51,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:51,752 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-13 04:00:51,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:51,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:51,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:51,759 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-13 04:00:51,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:51,762 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-13 04:00:51,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:00:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:52,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:52,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 04:00:52,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 04:00:52,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 04:00:52,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:00:52,376 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 40 states. [2018-04-13 04:00:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:54,589 INFO L93 Difference]: Finished difference Result 949 states and 969 transitions. [2018-04-13 04:00:54,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 04:00:54,590 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 114 [2018-04-13 04:00:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:54,591 INFO L225 Difference]: With dead ends: 949 [2018-04-13 04:00:54,591 INFO L226 Difference]: Without dead ends: 949 [2018-04-13 04:00:54,591 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=279, Invalid=5573, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 04:00:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-04-13 04:00:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 228. [2018-04-13 04:00:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:00:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:00:54,594 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:00:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:54,594 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:00:54,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 04:00:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:00:54,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:00:54,595 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:54,595 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:54,595 INFO L408 AbstractCegarLoop]: === Iteration 223 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:54,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1701316995, now seen corresponding path program 146 times [2018-04-13 04:00:54,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:54,595 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:54,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:54,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:00:54,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:54,606 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:54,609 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:54,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:54,610 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:54,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:00:54,696 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:00:54,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:54,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:54,711 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-13 04:00:54,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:54,715 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-13 04:00:54,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:54,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:54,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:54,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:54,727 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-13 04:00:54,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:54,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:54,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:54,735 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-13 04:00:54,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:54,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:54,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-13 04:00:54,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:00:54,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:54,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:54,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:14 [2018-04-13 04:00:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:55,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:55,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 04:00:55,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 04:00:55,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 04:00:55,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1558, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 04:00:55,512 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 41 states. [2018-04-13 04:00:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:00:58,344 INFO L93 Difference]: Finished difference Result 994 states and 1014 transitions. [2018-04-13 04:00:58,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 04:00:58,344 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 114 [2018-04-13 04:00:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:00:58,345 INFO L225 Difference]: With dead ends: 994 [2018-04-13 04:00:58,345 INFO L226 Difference]: Without dead ends: 994 [2018-04-13 04:00:58,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=294, Invalid=6026, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 04:00:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-04-13 04:00:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 228. [2018-04-13 04:00:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:00:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:00:58,348 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:00:58,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:00:58,348 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:00:58,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 04:00:58,348 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:00:58,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:00:58,348 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:00:58,348 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:00:58,348 INFO L408 AbstractCegarLoop]: === Iteration 224 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:00:58,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1783692596, now seen corresponding path program 147 times [2018-04-13 04:00:58,349 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:00:58,349 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:00:58,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:58,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:00:58,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:00:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:00:58,360 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:00:58,363 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:00:58,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:00:58,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:00:58,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:00:58,461 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-04-13 04:00:58,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:00:58,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:00:58,479 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-13 04:00:58,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:58,482 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-13 04:00:58,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:58,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:58,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:00:58,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:58,495 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-13 04:00:58,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:58,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:58,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:00:58,501 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-13 04:00:58,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:58,504 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-13 04:00:58,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:00:58,635 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 5 treesize of output 1 [2018-04-13 04:00:58,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:00:58,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:00:58,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-04-13 04:00:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 463 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:00:59,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:00:59,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 04:00:59,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 04:00:59,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 04:00:59,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1480, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:00:59,142 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 40 states. [2018-04-13 04:01:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:01,484 INFO L93 Difference]: Finished difference Result 1034 states and 1054 transitions. [2018-04-13 04:01:01,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 04:01:01,484 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 114 [2018-04-13 04:01:01,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:01,487 INFO L225 Difference]: With dead ends: 1034 [2018-04-13 04:01:01,487 INFO L226 Difference]: Without dead ends: 1034 [2018-04-13 04:01:01,487 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=279, Invalid=5573, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 04:01:01,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2018-04-13 04:01:01,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 228. [2018-04-13 04:01:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:01:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:01:01,492 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:01:01,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:01,493 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:01:01,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 04:01:01,493 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:01:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:01:01,493 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:01,493 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:01,493 INFO L408 AbstractCegarLoop]: === Iteration 225 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:01,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1866358813, now seen corresponding path program 148 times [2018-04-13 04:01:01,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:01,495 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:01,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:01,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:01:01,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:01,521 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:01,524 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:01,524 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:01,524 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:01,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:01:01,638 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:01:01,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:01:01,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:01,647 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-13 04:01:01,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:01,651 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-13 04:01:01,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:01,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:01,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:01:01,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:01,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:01,663 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-13 04:01:01,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:01,668 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-13 04:01:01,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:01,671 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-13 04:01:01,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:01:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:01:02,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:01:02,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 04:01:02,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 04:01:02,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 04:01:02,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 04:01:02,574 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 36 states. [2018-04-13 04:01:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:04,922 INFO L93 Difference]: Finished difference Result 1069 states and 1089 transitions. [2018-04-13 04:01:04,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 04:01:04,922 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 114 [2018-04-13 04:01:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:04,923 INFO L225 Difference]: With dead ends: 1069 [2018-04-13 04:01:04,923 INFO L226 Difference]: Without dead ends: 1069 [2018-04-13 04:01:04,923 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=232, Invalid=4324, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 04:01:04,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-04-13 04:01:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 228. [2018-04-13 04:01:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:01:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:01:04,926 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:01:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:04,926 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:01:04,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 04:01:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:01:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:01:04,926 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:04,926 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:04,926 INFO L408 AbstractCegarLoop]: === Iteration 226 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:04,926 INFO L82 PathProgramCache]: Analyzing trace with hash 663285868, now seen corresponding path program 149 times [2018-04-13 04:01:04,926 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:04,927 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:04,927 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:04,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:01:04,927 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:04,938 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:04,941 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:04,941 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:04,941 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:04,941 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:01:05,011 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-04-13 04:01:05,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:01:05,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:05,024 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-13 04:01:05,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:05,033 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-13 04:01:05,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:05,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:05,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:01:05,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:05,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:05,047 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-13 04:01:05,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:05,055 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-13 04:01:05,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:05,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:01:05,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 04:01:05,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 04:01:05,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:05,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:05,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 04:01:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:01:05,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:01:05,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 04:01:05,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 04:01:05,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 04:01:05,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1258, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 04:01:05,680 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 37 states. [2018-04-13 04:01:08,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:08,178 INFO L93 Difference]: Finished difference Result 1099 states and 1119 transitions. [2018-04-13 04:01:08,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 04:01:08,178 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 114 [2018-04-13 04:01:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:08,179 INFO L225 Difference]: With dead ends: 1099 [2018-04-13 04:01:08,179 INFO L226 Difference]: Without dead ends: 1099 [2018-04-13 04:01:08,179 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=251, Invalid=4719, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 04:01:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-04-13 04:01:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 228. [2018-04-13 04:01:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:01:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:01:08,181 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:01:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:08,182 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:01:08,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 04:01:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:01:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:01:08,182 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:08,182 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:08,182 INFO L408 AbstractCegarLoop]: === Iteration 227 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:08,182 INFO L82 PathProgramCache]: Analyzing trace with hash -393105853, now seen corresponding path program 150 times [2018-04-13 04:01:08,182 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:08,182 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:08,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:08,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:01:08,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:08,194 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:08,197 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:08,197 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:08,197 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:08,197 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:01:08,319 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-04-13 04:01:08,319 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:01:08,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:08,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-13 04:01:08,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:08,340 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-13 04:01:08,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:08,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:08,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:01:08,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:08,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:08,352 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-13 04:01:08,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:08,356 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-13 04:01:08,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:08,363 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-13 04:01:08,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:01:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 571 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:01:08,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:01:08,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 04:01:08,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 04:01:08,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 04:01:08,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 04:01:08,824 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 35 states. [2018-04-13 04:01:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:10,783 INFO L93 Difference]: Finished difference Result 1124 states and 1144 transitions. [2018-04-13 04:01:10,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 04:01:10,783 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 114 [2018-04-13 04:01:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:10,784 INFO L225 Difference]: With dead ends: 1124 [2018-04-13 04:01:10,784 INFO L226 Difference]: Without dead ends: 1124 [2018-04-13 04:01:10,784 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=4189, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 04:01:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2018-04-13 04:01:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 228. [2018-04-13 04:01:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:01:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:01:10,787 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:01:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:10,787 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:01:10,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 04:01:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:01:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:01:10,787 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:10,787 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:10,787 INFO L408 AbstractCegarLoop]: === Iteration 228 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:10,787 INFO L82 PathProgramCache]: Analyzing trace with hash -893295092, now seen corresponding path program 151 times [2018-04-13 04:01:10,787 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:10,787 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:10,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:10,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:01:10,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:10,800 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:10,803 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:10,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:10,803 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:10,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:01:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:10,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:10,884 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-13 04:01:10,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:10,887 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-13 04:01:10,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:10,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:10,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:01:10,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:10,899 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-13 04:01:10,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:10,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:10,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:10,907 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-13 04:01:10,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:10,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:01:10,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 04:01:11,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 04:01:11,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:11,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:11,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 04:01:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 0 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:01:11,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:01:11,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 04:01:11,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 04:01:11,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 04:01:11,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1120, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 04:01:11,600 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 35 states. [2018-04-13 04:01:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:14,343 INFO L93 Difference]: Finished difference Result 1144 states and 1164 transitions. [2018-04-13 04:01:14,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 04:01:14,344 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 114 [2018-04-13 04:01:14,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:14,344 INFO L225 Difference]: With dead ends: 1144 [2018-04-13 04:01:14,344 INFO L226 Difference]: Without dead ends: 1144 [2018-04-13 04:01:14,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=229, Invalid=4193, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 04:01:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-04-13 04:01:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 228. [2018-04-13 04:01:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:01:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:01:14,348 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:01:14,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:14,348 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:01:14,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 04:01:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:01:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:01:14,349 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:14,349 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:14,349 INFO L408 AbstractCegarLoop]: === Iteration 229 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:14,349 INFO L82 PathProgramCache]: Analyzing trace with hash -535939933, now seen corresponding path program 152 times [2018-04-13 04:01:14,349 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:14,349 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:14,350 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:14,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:01:14,350 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:14,365 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:14,367 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:14,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:14,368 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:14,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:01:14,400 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:01:14,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:01:14,411 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:14,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 6 treesize of output 5 [2018-04-13 04:01:14,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:14,416 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-13 04:01:14,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:14,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:14,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:01:14,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:14,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:14,427 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-13 04:01:14,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:14,433 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-13 04:01:14,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:14,437 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-13 04:01:14,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:01:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:01:14,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:01:14,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-13 04:01:14,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 04:01:14,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 04:01:14,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-04-13 04:01:14,861 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 32 states. [2018-04-13 04:01:16,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:16,657 INFO L93 Difference]: Finished difference Result 1159 states and 1179 transitions. [2018-04-13 04:01:16,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 04:01:16,657 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 114 [2018-04-13 04:01:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:16,658 INFO L225 Difference]: With dead ends: 1159 [2018-04-13 04:01:16,658 INFO L226 Difference]: Without dead ends: 1159 [2018-04-13 04:01:16,658 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=3348, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 04:01:16,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-04-13 04:01:16,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 228. [2018-04-13 04:01:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:01:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:01:16,660 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:01:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:16,660 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:01:16,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 04:01:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:01:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:01:16,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:16,661 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:16,661 INFO L408 AbstractCegarLoop]: === Iteration 230 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:16,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1650615212, now seen corresponding path program 153 times [2018-04-13 04:01:16,661 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:16,661 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:16,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:16,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:01:16,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:16,674 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:16,677 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:16,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:16,677 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:16,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:01:16,810 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-04-13 04:01:16,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:01:16,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:16,823 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-13 04:01:16,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:16,834 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-13 04:01:16,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:16,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:16,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:01:16,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:16,847 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-13 04:01:16,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:16,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:16,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:16,853 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-13 04:01:16,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:16,857 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-13 04:01:16,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:01:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:01:17,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:01:17,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 04:01:17,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 04:01:17,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 04:01:17,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=989, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 04:01:17,385 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 33 states. [2018-04-13 04:01:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:19,506 INFO L93 Difference]: Finished difference Result 1170 states and 1190 transitions. [2018-04-13 04:01:19,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 04:01:19,506 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 114 [2018-04-13 04:01:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:19,507 INFO L225 Difference]: With dead ends: 1170 [2018-04-13 04:01:19,507 INFO L226 Difference]: Without dead ends: 1170 [2018-04-13 04:01:19,507 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=3348, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 04:01:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-04-13 04:01:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 228. [2018-04-13 04:01:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 04:01:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2018-04-13 04:01:19,509 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 114 [2018-04-13 04:01:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:19,509 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2018-04-13 04:01:19,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 04:01:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2018-04-13 04:01:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:01:19,509 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:19,509 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:19,509 INFO L408 AbstractCegarLoop]: === Iteration 231 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1441608451, now seen corresponding path program 18 times [2018-04-13 04:01:19,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:19,510 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:19,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:19,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:01:19,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:19,525 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:19,530 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:19,530 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:19,531 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:19,531 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:01:19,666 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-13 04:01:19,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:01:19,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:19,679 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-13 04:01:19,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:19,683 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-13 04:01:19,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:19,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:19,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:01:19,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:19,694 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-13 04:01:19,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:19,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:19,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:19,702 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-13 04:01:19,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:19,705 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-13 04:01:19,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:01:20,035 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:01:20,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:01:20,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-13 04:01:20,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 04:01:20,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 04:01:20,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-04-13 04:01:20,036 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand 30 states. [2018-04-13 04:01:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:21,582 INFO L93 Difference]: Finished difference Result 1183 states and 1204 transitions. [2018-04-13 04:01:21,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 04:01:21,583 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 114 [2018-04-13 04:01:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:21,583 INFO L225 Difference]: With dead ends: 1183 [2018-04-13 04:01:21,584 INFO L226 Difference]: Without dead ends: 1183 [2018-04-13 04:01:21,584 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=2908, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 04:01:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-04-13 04:01:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 229. [2018-04-13 04:01:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-13 04:01:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 250 transitions. [2018-04-13 04:01:21,586 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 250 transitions. Word has length 114 [2018-04-13 04:01:21,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:21,586 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 250 transitions. [2018-04-13 04:01:21,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 04:01:21,586 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 250 transitions. [2018-04-13 04:01:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:01:21,587 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:21,587 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:21,587 INFO L408 AbstractCegarLoop]: === Iteration 232 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:21,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1459497821, now seen corresponding path program 19 times [2018-04-13 04:01:21,587 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:21,587 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:21,587 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:21,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:01:21,587 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:21,602 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:21,604 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:21,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:21,605 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:21,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:01:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:21,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:21,677 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-13 04:01:21,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:21,681 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-13 04:01:21,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:21,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:21,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:01:21,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:21,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:21,693 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-13 04:01:21,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:21,697 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-13 04:01:21,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:21,700 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-13 04:01:21,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:01:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:01:21,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:01:21,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 04:01:21,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 04:01:21,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 04:01:21,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:01:21,977 INFO L87 Difference]: Start difference. First operand 229 states and 250 transitions. Second operand 28 states. [2018-04-13 04:01:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:23,317 INFO L93 Difference]: Finished difference Result 1185 states and 1207 transitions. [2018-04-13 04:01:23,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 04:01:23,317 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 114 [2018-04-13 04:01:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:23,318 INFO L225 Difference]: With dead ends: 1185 [2018-04-13 04:01:23,318 INFO L226 Difference]: Without dead ends: 1185 [2018-04-13 04:01:23,318 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=2498, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 04:01:23,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2018-04-13 04:01:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 233. [2018-04-13 04:01:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-13 04:01:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 254 transitions. [2018-04-13 04:01:23,321 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 254 transitions. Word has length 114 [2018-04-13 04:01:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:23,321 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 254 transitions. [2018-04-13 04:01:23,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 04:01:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 254 transitions. [2018-04-13 04:01:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:01:23,321 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:23,321 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:23,321 INFO L408 AbstractCegarLoop]: === Iteration 233 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:23,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2080623432, now seen corresponding path program 19 times [2018-04-13 04:01:23,321 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:23,322 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:23,322 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:23,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:01:23,322 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:23,330 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:23,334 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:23,334 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:23,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:23,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:01:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:23,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:23,364 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-13 04:01:23,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:23,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:23,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:01:23,381 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:01:23,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:01:23,389 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 2 xjuncts. [2018-04-13 04:01:23,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-04-13 04:01:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:01:25,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:01:25,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-13 04:01:25,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-13 04:01:25,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-13 04:01:25,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=2859, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 04:01:25,147 INFO L87 Difference]: Start difference. First operand 233 states and 254 transitions. Second operand 55 states. [2018-04-13 04:01:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:30,880 INFO L93 Difference]: Finished difference Result 339 states and 360 transitions. [2018-04-13 04:01:30,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-13 04:01:30,881 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 119 [2018-04-13 04:01:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:30,881 INFO L225 Difference]: With dead ends: 339 [2018-04-13 04:01:30,881 INFO L226 Difference]: Without dead ends: 339 [2018-04-13 04:01:30,881 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=423, Invalid=10919, Unknown=0, NotChecked=0, Total=11342 [2018-04-13 04:01:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-04-13 04:01:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 238. [2018-04-13 04:01:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:01:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:01:30,883 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:01:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:30,883 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:01:30,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-13 04:01:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:01:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:01:30,883 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:30,883 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:30,883 INFO L408 AbstractCegarLoop]: === Iteration 234 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:30,883 INFO L82 PathProgramCache]: Analyzing trace with hash -487198902, now seen corresponding path program 8 times [2018-04-13 04:01:30,883 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:30,884 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:30,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:30,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:01:30,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:30,892 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:30,898 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:30,898 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:30,898 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:30,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:01:30,925 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:01:30,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:01:30,931 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:30,933 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-13 04:01:30,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:30,936 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-13 04:01:30,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:30,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:30,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:01:30,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:30,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:30,949 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-13 04:01:30,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:30,954 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-13 04:01:30,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:30,957 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-13 04:01:30,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:01:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:01:33,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:01:33,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-13 04:01:33,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-13 04:01:33,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-13 04:01:33,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 04:01:33,365 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 51 states. [2018-04-13 04:01:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:38,185 INFO L93 Difference]: Finished difference Result 433 states and 454 transitions. [2018-04-13 04:01:38,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-13 04:01:38,186 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 119 [2018-04-13 04:01:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:38,186 INFO L225 Difference]: With dead ends: 433 [2018-04-13 04:01:38,186 INFO L226 Difference]: Without dead ends: 433 [2018-04-13 04:01:38,186 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=380, Invalid=9126, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 04:01:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-04-13 04:01:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 238. [2018-04-13 04:01:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:01:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:01:38,188 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:01:38,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:38,188 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:01:38,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-13 04:01:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:01:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:01:38,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:38,188 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:38,188 INFO L408 AbstractCegarLoop]: === Iteration 235 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:38,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1962379295, now seen corresponding path program 154 times [2018-04-13 04:01:38,188 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:38,189 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:38,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:38,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:01:38,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:38,197 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:38,202 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:38,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:38,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:38,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:01:38,245 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:01:38,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:01:38,250 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:38,252 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-13 04:01:38,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:38,255 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-13 04:01:38,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:38,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:38,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:01:38,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:38,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:38,267 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-13 04:01:38,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:38,271 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-13 04:01:38,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:38,274 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-13 04:01:38,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:01:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 0 proven. 842 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:01:40,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:01:40,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-13 04:01:40,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-13 04:01:40,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-13 04:01:40,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 04:01:40,440 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 49 states. [2018-04-13 04:01:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:44,951 INFO L93 Difference]: Finished difference Result 429 states and 450 transitions. [2018-04-13 04:01:44,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-13 04:01:44,951 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 119 [2018-04-13 04:01:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:44,952 INFO L225 Difference]: With dead ends: 429 [2018-04-13 04:01:44,952 INFO L226 Difference]: Without dead ends: 429 [2018-04-13 04:01:44,952 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=362, Invalid=8380, Unknown=0, NotChecked=0, Total=8742 [2018-04-13 04:01:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-04-13 04:01:44,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 238. [2018-04-13 04:01:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:01:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:01:44,954 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:01:44,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:44,954 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:01:44,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-13 04:01:44,954 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:01:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:01:44,954 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:44,954 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:44,954 INFO L408 AbstractCegarLoop]: === Iteration 236 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:44,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1886039274, now seen corresponding path program 155 times [2018-04-13 04:01:44,954 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:44,954 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:44,955 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:44,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:01:44,955 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:44,963 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:44,969 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:44,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:44,969 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:44,969 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:01:45,009 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-13 04:01:45,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:01:45,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:45,016 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-13 04:01:45,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:45,019 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-13 04:01:45,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:45,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:45,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:01:45,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:45,035 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-13 04:01:45,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:45,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:45,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:45,043 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-13 04:01:45,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:45,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:01:45,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 04:01:45,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:01:45,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:45,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:45,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:14 [2018-04-13 04:01:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 0 proven. 763 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:01:46,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:01:46,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-13 04:01:46,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-13 04:01:46,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-13 04:01:46,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2448, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 04:01:46,199 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 51 states. [2018-04-13 04:01:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:50,210 INFO L93 Difference]: Finished difference Result 519 states and 540 transitions. [2018-04-13 04:01:50,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 04:01:50,210 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 119 [2018-04-13 04:01:50,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:50,211 INFO L225 Difference]: With dead ends: 519 [2018-04-13 04:01:50,211 INFO L226 Difference]: Without dead ends: 519 [2018-04-13 04:01:50,211 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=390, Invalid=9510, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 04:01:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-04-13 04:01:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 238. [2018-04-13 04:01:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:01:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:01:50,213 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:01:50,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:50,213 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:01:50,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-13 04:01:50,213 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:01:50,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:01:50,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:50,213 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:50,213 INFO L408 AbstractCegarLoop]: === Iteration 237 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:50,213 INFO L82 PathProgramCache]: Analyzing trace with hash 633058881, now seen corresponding path program 156 times [2018-04-13 04:01:50,213 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:50,213 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:50,214 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:50,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:01:50,214 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:50,222 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:50,230 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:50,231 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:50,231 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:50,231 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:01:50,275 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-04-13 04:01:50,275 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:01:50,282 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:50,284 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-13 04:01:50,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:50,288 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-13 04:01:50,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:50,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:50,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:01:50,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:50,299 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-13 04:01:50,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:50,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:50,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:50,305 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-13 04:01:50,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:50,308 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-13 04:01:50,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:01:50,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-13 04:01:50,365 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 5 treesize of output 1 [2018-04-13 04:01:50,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:50,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:50,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:01:50,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:21 [2018-04-13 04:01:50,507 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 11 treesize of output 1 [2018-04-13 04:01:50,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:50,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:50,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-13 04:01:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:01:51,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:01:51,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-13 04:01:51,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-13 04:01:51,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-13 04:01:51,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2253, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 04:01:51,202 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 49 states. [2018-04-13 04:01:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:01:53,777 INFO L93 Difference]: Finished difference Result 604 states and 625 transitions. [2018-04-13 04:01:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 04:01:53,777 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 119 [2018-04-13 04:01:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:01:53,778 INFO L225 Difference]: With dead ends: 604 [2018-04-13 04:01:53,778 INFO L226 Difference]: Without dead ends: 604 [2018-04-13 04:01:53,778 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=358, Invalid=8198, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 04:01:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-04-13 04:01:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 238. [2018-04-13 04:01:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:01:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:01:53,779 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:01:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:01:53,780 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:01:53,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-13 04:01:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:01:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:01:53,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:01:53,780 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:01:53,780 INFO L408 AbstractCegarLoop]: === Iteration 238 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:01:53,780 INFO L82 PathProgramCache]: Analyzing trace with hash -75369846, now seen corresponding path program 157 times [2018-04-13 04:01:53,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:01:53,780 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:01:53,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:53,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:01:53,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:01:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:53,790 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:01:53,792 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:01:53,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:01:53,793 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:01:53,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:01:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:01:53,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:01:53,851 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-13 04:01:53,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:53,855 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-13 04:01:53,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:53,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:01:53,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:01:53,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:53,869 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-13 04:01:53,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:53,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:53,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:01:53,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, 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-13 04:01:53,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:01:53,878 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-13 04:01:53,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 0 proven. 635 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:03,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:03,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 04:02:03,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 04:02:03,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 04:02:03,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 04:02:03,380 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 46 states. [2018-04-13 04:02:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:07,277 INFO L93 Difference]: Finished difference Result 684 states and 705 transitions. [2018-04-13 04:02:07,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 04:02:07,277 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 119 [2018-04-13 04:02:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:07,277 INFO L225 Difference]: With dead ends: 684 [2018-04-13 04:02:07,277 INFO L226 Difference]: Without dead ends: 684 [2018-04-13 04:02:07,278 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=332, Invalid=7324, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 04:02:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-04-13 04:02:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 238. [2018-04-13 04:02:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:07,279 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:07,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:07,280 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:07,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 04:02:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:07,280 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:07,280 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:07,280 INFO L408 AbstractCegarLoop]: === Iteration 239 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash -648581983, now seen corresponding path program 158 times [2018-04-13 04:02:07,280 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:07,280 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:07,280 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:07,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:02:07,281 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:07,290 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:07,293 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:07,293 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:07,293 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:07,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:02:07,312 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:02:07,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:07,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:07,318 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-13 04:02:07,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:07,321 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-13 04:02:07,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:07,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:07,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:07,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:07,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:07,332 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-13 04:02:07,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:07,337 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-13 04:02:07,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:07,339 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-13 04:02:07,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 586 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:12,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:12,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 04:02:12,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 04:02:12,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 04:02:12,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 04:02:12,230 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 45 states. [2018-04-13 04:02:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:15,896 INFO L93 Difference]: Finished difference Result 759 states and 780 transitions. [2018-04-13 04:02:15,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 04:02:15,896 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-04-13 04:02:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:15,896 INFO L225 Difference]: With dead ends: 759 [2018-04-13 04:02:15,896 INFO L226 Difference]: Without dead ends: 759 [2018-04-13 04:02:15,897 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=322, Invalid=6988, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 04:02:15,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-04-13 04:02:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 238. [2018-04-13 04:02:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:15,898 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:15,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:15,898 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:15,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 04:02:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:15,899 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:15,899 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:15,899 INFO L408 AbstractCegarLoop]: === Iteration 240 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:15,899 INFO L82 PathProgramCache]: Analyzing trace with hash 742768682, now seen corresponding path program 159 times [2018-04-13 04:02:15,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:15,899 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:15,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:15,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:02:15,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:15,909 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:15,911 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:15,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:15,911 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:15,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:02:15,989 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-04-13 04:02:15,989 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:16,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:16,001 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-13 04:02:16,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:16,005 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-13 04:02:16,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:16,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:16,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:16,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:16,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:16,016 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-13 04:02:16,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:16,021 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-13 04:02:16,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:16,024 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-13 04:02:16,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 0 proven. 547 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:16,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:16,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-13 04:02:16,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 04:02:16,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 04:02:16,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 04:02:16,721 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 44 states. [2018-04-13 04:02:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:18,934 INFO L93 Difference]: Finished difference Result 829 states and 850 transitions. [2018-04-13 04:02:18,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 04:02:18,934 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 119 [2018-04-13 04:02:18,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:18,935 INFO L225 Difference]: With dead ends: 829 [2018-04-13 04:02:18,935 INFO L226 Difference]: Without dead ends: 829 [2018-04-13 04:02:18,935 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=312, Invalid=6660, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 04:02:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-04-13 04:02:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 238. [2018-04-13 04:02:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:18,937 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:18,937 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:18,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 04:02:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:18,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:18,937 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:18,937 INFO L408 AbstractCegarLoop]: === Iteration 241 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:18,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1617847551, now seen corresponding path program 160 times [2018-04-13 04:02:18,938 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:18,938 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:18,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:18,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:02:18,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:18,948 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:18,950 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:18,950 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:18,950 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:18,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:02:19,004 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:02:19,004 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:19,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:19,012 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-13 04:02:19,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:19,016 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-13 04:02:19,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:19,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:19,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:19,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:19,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:19,027 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-13 04:02:19,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:19,032 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-13 04:02:19,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:19,035 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-13 04:02:19,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 0 proven. 518 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:19,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:19,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 04:02:19,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 04:02:19,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 04:02:19,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1890, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 04:02:19,730 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 45 states. [2018-04-13 04:02:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:22,060 INFO L93 Difference]: Finished difference Result 894 states and 915 transitions. [2018-04-13 04:02:22,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 04:02:22,061 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-04-13 04:02:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:22,061 INFO L225 Difference]: With dead ends: 894 [2018-04-13 04:02:22,061 INFO L226 Difference]: Without dead ends: 894 [2018-04-13 04:02:22,062 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=322, Invalid=6988, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 04:02:22,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-04-13 04:02:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 238. [2018-04-13 04:02:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:22,063 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:22,064 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:22,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 04:02:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:22,064 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:22,064 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:22,064 INFO L408 AbstractCegarLoop]: === Iteration 242 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:22,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1329599946, now seen corresponding path program 161 times [2018-04-13 04:02:22,064 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:22,064 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:22,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:22,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:02:22,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:22,075 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:22,077 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:22,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:22,077 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:22,078 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:02:22,132 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 04:02:22,132 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:22,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:22,139 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-13 04:02:22,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:22,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:02:22,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:22,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:22,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:22,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:22,154 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-13 04:02:22,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:22,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:22,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:22,165 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-13 04:02:22,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:22,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:02:22,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 04:02:22,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 04:02:22,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:22,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:22,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 04:02:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:23,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:23,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 04:02:23,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 04:02:23,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 04:02:23,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 04:02:23,012 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 43 states. [2018-04-13 04:02:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:26,214 INFO L93 Difference]: Finished difference Result 954 states and 975 transitions. [2018-04-13 04:02:26,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 04:02:26,214 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 119 [2018-04-13 04:02:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:26,215 INFO L225 Difference]: With dead ends: 954 [2018-04-13 04:02:26,215 INFO L226 Difference]: Without dead ends: 954 [2018-04-13 04:02:26,215 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=308, Invalid=6498, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 04:02:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-04-13 04:02:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 238. [2018-04-13 04:02:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:26,217 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:26,217 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:26,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 04:02:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:26,218 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:26,218 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:26,218 INFO L408 AbstractCegarLoop]: === Iteration 243 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash -39829151, now seen corresponding path program 162 times [2018-04-13 04:02:26,218 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:26,218 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:26,218 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:26,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:02:26,218 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:26,229 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:26,232 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:26,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:26,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:26,233 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:02:26,352 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-04-13 04:02:26,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:26,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:26,368 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-13 04:02:26,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:26,375 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-13 04:02:26,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:26,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:26,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:26,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:26,386 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-13 04:02:26,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:26,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:26,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:26,393 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-13 04:02:26,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:26,396 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-13 04:02:26,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:26,991 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:26,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:26,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 04:02:26,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 04:02:26,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 04:02:26,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 04:02:26,992 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 41 states. [2018-04-13 04:02:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:29,111 INFO L93 Difference]: Finished difference Result 1009 states and 1030 transitions. [2018-04-13 04:02:29,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 04:02:29,111 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 119 [2018-04-13 04:02:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:29,112 INFO L225 Difference]: With dead ends: 1009 [2018-04-13 04:02:29,112 INFO L226 Difference]: Without dead ends: 1009 [2018-04-13 04:02:29,113 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=282, Invalid=5724, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 04:02:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-04-13 04:02:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 238. [2018-04-13 04:02:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:29,118 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:29,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:29,118 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:29,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 04:02:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:29,118 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:29,119 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:29,119 INFO L408 AbstractCegarLoop]: === Iteration 244 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash -176491670, now seen corresponding path program 163 times [2018-04-13 04:02:29,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:29,119 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:29,119 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:29,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:02:29,119 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:29,130 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:29,133 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:29,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:29,133 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:29,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:02:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:29,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:29,182 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-13 04:02:29,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:29,186 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-13 04:02:29,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:29,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:29,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:29,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:29,198 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-13 04:02:29,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:29,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:29,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:29,204 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-13 04:02:29,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:29,208 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-13 04:02:29,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:29,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:29,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 04:02:29,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 04:02:29,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 04:02:29,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:02:29,785 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 40 states. [2018-04-13 04:02:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:31,902 INFO L93 Difference]: Finished difference Result 1059 states and 1080 transitions. [2018-04-13 04:02:31,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 04:02:31,902 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 119 [2018-04-13 04:02:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:31,903 INFO L225 Difference]: With dead ends: 1059 [2018-04-13 04:02:31,903 INFO L226 Difference]: Without dead ends: 1059 [2018-04-13 04:02:31,903 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=272, Invalid=5428, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 04:02:31,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-04-13 04:02:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 238. [2018-04-13 04:02:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:31,906 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:31,906 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:31,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 04:02:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:31,907 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:31,907 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:31,907 INFO L408 AbstractCegarLoop]: === Iteration 245 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:31,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1681481665, now seen corresponding path program 164 times [2018-04-13 04:02:31,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:31,907 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:31,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:31,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:02:31,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:31,919 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:31,922 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:31,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:31,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:31,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:02:31,948 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:02:31,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:31,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:31,957 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-13 04:02:31,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:31,960 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-13 04:02:31,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:31,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:31,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:31,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:31,984 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-13 04:02:31,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:31,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:31,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:31,991 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-13 04:02:31,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:31,994 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-13 04:02:31,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 502 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:32,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:32,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 04:02:32,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 04:02:32,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 04:02:32,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:02:32,936 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 40 states. [2018-04-13 04:02:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:35,802 INFO L93 Difference]: Finished difference Result 1104 states and 1125 transitions. [2018-04-13 04:02:35,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 04:02:35,802 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 119 [2018-04-13 04:02:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:35,803 INFO L225 Difference]: With dead ends: 1104 [2018-04-13 04:02:35,803 INFO L226 Difference]: Without dead ends: 1104 [2018-04-13 04:02:35,804 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=266, Invalid=5434, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 04:02:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2018-04-13 04:02:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 238. [2018-04-13 04:02:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:35,808 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:35,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:35,808 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:35,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 04:02:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:35,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:35,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:35,809 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:35,809 INFO L408 AbstractCegarLoop]: === Iteration 246 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1803527926, now seen corresponding path program 165 times [2018-04-13 04:02:35,809 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:35,809 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:35,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:35,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:02:35,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:35,821 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:35,824 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:35,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:35,824 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:35,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:02:35,995 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-04-13 04:02:35,995 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:36,006 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:36,008 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-13 04:02:36,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:36,011 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-13 04:02:36,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:36,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:36,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:36,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:36,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:36,028 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-13 04:02:36,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:36,033 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-13 04:02:36,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:36,036 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-13 04:02:36,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 0 proven. 523 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:36,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:36,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 04:02:36,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 04:02:36,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 04:02:36,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 04:02:36,563 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 38 states. [2018-04-13 04:02:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:38,605 INFO L93 Difference]: Finished difference Result 1144 states and 1165 transitions. [2018-04-13 04:02:38,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 04:02:38,606 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 119 [2018-04-13 04:02:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:38,607 INFO L225 Difference]: With dead ends: 1144 [2018-04-13 04:02:38,607 INFO L226 Difference]: Without dead ends: 1144 [2018-04-13 04:02:38,607 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=252, Invalid=4860, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 04:02:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-04-13 04:02:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 238. [2018-04-13 04:02:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:38,609 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:38,610 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:38,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 04:02:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:38,610 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:38,610 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:38,610 INFO L408 AbstractCegarLoop]: === Iteration 247 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:38,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1886194143, now seen corresponding path program 166 times [2018-04-13 04:02:38,611 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:38,611 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:38,611 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:38,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:02:38,611 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:38,623 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:38,626 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:38,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:38,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:38,626 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:02:38,675 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:02:38,675 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:38,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:38,684 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-13 04:02:38,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:38,687 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-13 04:02:38,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:38,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:38,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:38,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:38,699 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-13 04:02:38,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:38,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:38,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:38,705 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-13 04:02:38,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:38,709 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-13 04:02:38,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 0 proven. 554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:39,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:39,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 04:02:39,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 04:02:39,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 04:02:39,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 04:02:39,218 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 38 states. [2018-04-13 04:02:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:41,278 INFO L93 Difference]: Finished difference Result 1179 states and 1200 transitions. [2018-04-13 04:02:41,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 04:02:41,278 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 119 [2018-04-13 04:02:41,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:41,279 INFO L225 Difference]: With dead ends: 1179 [2018-04-13 04:02:41,279 INFO L226 Difference]: Without dead ends: 1179 [2018-04-13 04:02:41,280 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=4859, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 04:02:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-04-13 04:02:41,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 238. [2018-04-13 04:02:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:41,283 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:41,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:41,283 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:41,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 04:02:41,284 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:41,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:41,284 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:41,284 INFO L408 AbstractCegarLoop]: === Iteration 248 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:41,284 INFO L82 PathProgramCache]: Analyzing trace with hash 643450538, now seen corresponding path program 167 times [2018-04-13 04:02:41,285 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:41,285 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:41,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:41,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:02:41,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:41,300 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:41,303 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:41,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:41,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:41,303 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:02:41,387 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-04-13 04:02:41,387 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:41,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:41,399 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-13 04:02:41,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:41,402 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-13 04:02:41,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:41,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:41,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:41,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:41,414 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-13 04:02:41,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:41,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:41,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:41,422 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-13 04:02:41,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:41,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:02:41,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 04:02:41,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 04:02:41,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:41,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:41,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 04:02:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:42,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:42,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 04:02:42,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 04:02:42,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 04:02:42,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1330, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 04:02:42,133 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 38 states. [2018-04-13 04:02:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:44,708 INFO L93 Difference]: Finished difference Result 1209 states and 1230 transitions. [2018-04-13 04:02:44,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 04:02:44,709 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 119 [2018-04-13 04:02:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:44,709 INFO L225 Difference]: With dead ends: 1209 [2018-04-13 04:02:44,709 INFO L226 Difference]: Without dead ends: 1209 [2018-04-13 04:02:44,710 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=255, Invalid=5001, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 04:02:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2018-04-13 04:02:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 238. [2018-04-13 04:02:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:44,713 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:44,713 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:44,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 04:02:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:44,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:44,714 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:44,714 INFO L408 AbstractCegarLoop]: === Iteration 249 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:44,714 INFO L82 PathProgramCache]: Analyzing trace with hash -412941183, now seen corresponding path program 168 times [2018-04-13 04:02:44,714 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:44,714 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:44,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:44,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:02:44,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:44,736 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:44,740 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:44,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:44,740 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:44,741 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:02:44,844 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-04-13 04:02:44,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:44,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:44,859 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-13 04:02:44,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:44,863 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-13 04:02:44,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:44,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:44,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:44,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:44,875 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-13 04:02:44,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:44,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:44,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:44,881 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-13 04:02:44,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:44,884 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-13 04:02:44,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:45,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:45,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 04:02:45,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 04:02:45,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 04:02:45,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 04:02:45,327 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 35 states. [2018-04-13 04:02:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:47,214 INFO L93 Difference]: Finished difference Result 1234 states and 1255 transitions. [2018-04-13 04:02:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 04:02:47,214 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 119 [2018-04-13 04:02:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:47,215 INFO L225 Difference]: With dead ends: 1234 [2018-04-13 04:02:47,215 INFO L226 Difference]: Without dead ends: 1234 [2018-04-13 04:02:47,215 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=4068, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 04:02:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2018-04-13 04:02:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 238. [2018-04-13 04:02:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:47,217 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:47,217 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:47,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 04:02:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:47,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:47,217 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:47,217 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:47,218 INFO L408 AbstractCegarLoop]: === Iteration 250 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:47,218 INFO L82 PathProgramCache]: Analyzing trace with hash -913130422, now seen corresponding path program 169 times [2018-04-13 04:02:47,218 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:47,218 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:47,218 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:47,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:02:47,218 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:47,231 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:47,233 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:47,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:47,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:47,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:02:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:47,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:47,297 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-13 04:02:47,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:47,300 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-13 04:02:47,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:47,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:47,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:47,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:47,313 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-13 04:02:47,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:47,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:47,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:47,320 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-13 04:02:47,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:47,323 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-13 04:02:47,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 0 proven. 707 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:47,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:47,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 04:02:47,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 04:02:47,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 04:02:47,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 04:02:47,743 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 34 states. [2018-04-13 04:02:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:49,555 INFO L93 Difference]: Finished difference Result 1254 states and 1275 transitions. [2018-04-13 04:02:49,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 04:02:49,555 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 119 [2018-04-13 04:02:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:49,555 INFO L225 Difference]: With dead ends: 1254 [2018-04-13 04:02:49,555 INFO L226 Difference]: Without dead ends: 1254 [2018-04-13 04:02:49,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=3820, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 04:02:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2018-04-13 04:02:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 238. [2018-04-13 04:02:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:49,558 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:49,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:49,558 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:49,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 04:02:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:49,558 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:49,559 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:49,559 INFO L408 AbstractCegarLoop]: === Iteration 251 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:49,559 INFO L82 PathProgramCache]: Analyzing trace with hash -555775263, now seen corresponding path program 170 times [2018-04-13 04:02:49,559 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:49,559 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:49,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:49,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:02:49,560 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:49,583 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:49,587 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:49,587 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:49,588 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:49,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:02:49,680 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:02:49,680 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:49,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:49,695 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-13 04:02:49,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:49,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:02:49,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:49,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:49,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:49,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:49,711 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-13 04:02:49,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:49,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:49,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:49,717 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-13 04:02:49,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:49,721 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-13 04:02:49,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 0 proven. 778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:50,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:50,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 04:02:50,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 04:02:50,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 04:02:50,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 04:02:50,156 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 33 states. [2018-04-13 04:02:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:52,075 INFO L93 Difference]: Finished difference Result 1269 states and 1290 transitions. [2018-04-13 04:02:52,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 04:02:52,076 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 119 [2018-04-13 04:02:52,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:52,076 INFO L225 Difference]: With dead ends: 1269 [2018-04-13 04:02:52,077 INFO L226 Difference]: Without dead ends: 1269 [2018-04-13 04:02:52,077 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=198, Invalid=3584, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 04:02:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2018-04-13 04:02:52,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 238. [2018-04-13 04:02:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:52,079 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:52,079 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:52,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 04:02:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:52,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:52,079 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:52,079 INFO L408 AbstractCegarLoop]: === Iteration 252 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:52,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1630779882, now seen corresponding path program 171 times [2018-04-13 04:02:52,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:52,080 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:52,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:52,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:02:52,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:52,094 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:52,096 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:52,096 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:52,096 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:52,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:02:52,211 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-04-13 04:02:52,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:52,231 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:52,233 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-13 04:02:52,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:52,236 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-13 04:02:52,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:52,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:52,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:52,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:52,246 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-13 04:02:52,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:52,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:52,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:52,253 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-13 04:02:52,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:52,256 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-13 04:02:52,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 0 proven. 859 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:52,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:52,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 04:02:52,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 04:02:52,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 04:02:52,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 04:02:52,648 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 33 states. [2018-04-13 04:02:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:54,423 INFO L93 Difference]: Finished difference Result 1280 states and 1301 transitions. [2018-04-13 04:02:54,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 04:02:54,451 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 119 [2018-04-13 04:02:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:54,452 INFO L225 Difference]: With dead ends: 1280 [2018-04-13 04:02:54,452 INFO L226 Difference]: Without dead ends: 1280 [2018-04-13 04:02:54,452 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=201, Invalid=3581, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 04:02:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2018-04-13 04:02:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 238. [2018-04-13 04:02:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 04:02:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-04-13 04:02:54,454 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 119 [2018-04-13 04:02:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:54,454 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-04-13 04:02:54,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 04:02:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-04-13 04:02:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:54,455 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:54,455 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:54,455 INFO L408 AbstractCegarLoop]: === Iteration 253 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:54,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1421773121, now seen corresponding path program 19 times [2018-04-13 04:02:54,455 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:54,455 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:54,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:54,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:02:54,456 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:54,473 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:54,479 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:54,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:54,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:54,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:02:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:54,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:54,645 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-13 04:02:54,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:54,649 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-13 04:02:54,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:54,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:54,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:54,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:54,660 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-13 04:02:54,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:54,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:54,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:54,667 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-13 04:02:54,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:54,670 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-13 04:02:54,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:55,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:55,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 04:02:55,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 04:02:55,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 04:02:55,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-13 04:02:55,011 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 31 states. [2018-04-13 04:02:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:56,635 INFO L93 Difference]: Finished difference Result 1293 states and 1315 transitions. [2018-04-13 04:02:56,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 04:02:56,635 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 119 [2018-04-13 04:02:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:56,636 INFO L225 Difference]: With dead ends: 1293 [2018-04-13 04:02:56,636 INFO L226 Difference]: Without dead ends: 1293 [2018-04-13 04:02:56,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=3128, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 04:02:56,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2018-04-13 04:02:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 239. [2018-04-13 04:02:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-04-13 04:02:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 261 transitions. [2018-04-13 04:02:56,638 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 261 transitions. Word has length 119 [2018-04-13 04:02:56,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:56,639 INFO L459 AbstractCegarLoop]: Abstraction has 239 states and 261 transitions. [2018-04-13 04:02:56,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 04:02:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 261 transitions. [2018-04-13 04:02:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:02:56,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:56,639 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:56,639 INFO L408 AbstractCegarLoop]: === Iteration 254 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:56,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1439662491, now seen corresponding path program 20 times [2018-04-13 04:02:56,639 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:56,639 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:56,639 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:56,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:02:56,640 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:56,655 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:56,658 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:56,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:56,658 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:56,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:02:56,695 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:02:56,695 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:56,705 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:56,707 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-13 04:02:56,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:56,710 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-13 04:02:56,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:56,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:56,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:56,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:56,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:56,729 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-13 04:02:56,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:56,733 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-13 04:02:56,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:56,737 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-13 04:02:56,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:02:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:02:57,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:02:57,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 04:02:57,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 04:02:57,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 04:02:57,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-04-13 04:02:57,046 INFO L87 Difference]: Start difference. First operand 239 states and 261 transitions. Second operand 29 states. [2018-04-13 04:02:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:02:58,560 INFO L93 Difference]: Finished difference Result 1295 states and 1318 transitions. [2018-04-13 04:02:58,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 04:02:58,560 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 119 [2018-04-13 04:02:58,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:02:58,561 INFO L225 Difference]: With dead ends: 1295 [2018-04-13 04:02:58,561 INFO L226 Difference]: Without dead ends: 1295 [2018-04-13 04:02:58,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=2702, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 04:02:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2018-04-13 04:02:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 243. [2018-04-13 04:02:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-13 04:02:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 265 transitions. [2018-04-13 04:02:58,564 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 265 transitions. Word has length 119 [2018-04-13 04:02:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:02:58,564 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 265 transitions. [2018-04-13 04:02:58,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 04:02:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 265 transitions. [2018-04-13 04:02:58,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:02:58,564 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:02:58,565 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:02:58,565 INFO L408 AbstractCegarLoop]: === Iteration 255 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:02:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1866106053, now seen corresponding path program 20 times [2018-04-13 04:02:58,565 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:02:58,565 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:02:58,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:58,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:02:58,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:02:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:02:58,574 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:02:58,580 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:02:58,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:02:58,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:02:58,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:02:58,615 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:02:58,615 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:02:58,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:02:58,623 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-13 04:02:58,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:58,626 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-13 04:02:58,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:58,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:02:58,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:02:58,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:58,637 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-13 04:02:58,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:58,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:58,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:02:58,648 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-13 04:02:58,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:02:58,651 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-13 04:02:58,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:03:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:03:01,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:03:01,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-13 04:03:01,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-13 04:03:01,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-13 04:03:01,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 04:03:01,416 INFO L87 Difference]: Start difference. First operand 243 states and 265 transitions. Second operand 53 states. [2018-04-13 04:03:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:03:06,940 INFO L93 Difference]: Finished difference Result 349 states and 371 transitions. [2018-04-13 04:03:06,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 04:03:06,941 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 124 [2018-04-13 04:03:06,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:03:06,941 INFO L225 Difference]: With dead ends: 349 [2018-04-13 04:03:06,941 INFO L226 Difference]: Without dead ends: 349 [2018-04-13 04:03:06,942 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=396, Invalid=9906, Unknown=0, NotChecked=0, Total=10302 [2018-04-13 04:03:06,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-13 04:03:06,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 248. [2018-04-13 04:03:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:03:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:03:06,943 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:03:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:03:06,943 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:03:06,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-13 04:03:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:03:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:03:06,943 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:03:06,944 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:03:06,944 INFO L408 AbstractCegarLoop]: === Iteration 256 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:03:06,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1453928500, now seen corresponding path program 172 times [2018-04-13 04:03:06,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:03:06,944 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:03:06,944 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:06,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:03:06,944 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:06,953 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:03:06,959 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:03:06,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:03:06,959 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:03:06,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:03:06,984 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:03:06,985 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:03:06,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:03:06,991 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-13 04:03:06,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:06,995 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-13 04:03:06,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:06,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:06,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:03:07,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:07,006 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-13 04:03:07,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:07,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:07,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:07,013 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-13 04:03:07,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:07,016 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-13 04:03:07,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:03:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:03:08,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:03:08,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-13 04:03:08,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-13 04:03:08,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-13 04:03:08,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 04:03:08,031 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 52 states. [2018-04-13 04:03:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:03:10,780 INFO L93 Difference]: Finished difference Result 449 states and 471 transitions. [2018-04-13 04:03:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 04:03:10,780 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 124 [2018-04-13 04:03:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:03:10,781 INFO L225 Difference]: With dead ends: 449 [2018-04-13 04:03:10,781 INFO L226 Difference]: Without dead ends: 449 [2018-04-13 04:03:10,781 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=391, Invalid=9709, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 04:03:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-04-13 04:03:10,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 248. [2018-04-13 04:03:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:03:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:03:10,784 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:03:10,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:03:10,784 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:03:10,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-13 04:03:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:03:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:03:10,785 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:03:10,785 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:03:10,785 INFO L408 AbstractCegarLoop]: === Iteration 257 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:03:10,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1365858403, now seen corresponding path program 173 times [2018-04-13 04:03:10,785 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:03:10,785 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:03:10,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:10,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:03:10,786 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:10,795 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:03:10,801 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:03:10,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:03:10,801 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:03:10,801 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:03:10,865 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-04-13 04:03:10,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:03:10,871 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:03:10,873 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-13 04:03:10,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:10,876 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-13 04:03:10,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:10,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:10,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:03:10,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:10,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:10,888 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-13 04:03:10,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:10,892 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-13 04:03:10,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:10,895 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-13 04:03:10,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:03:11,070 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 5 treesize of output 1 [2018-04-13 04:03:11,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:11,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:11,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-04-13 04:03:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:03:11,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:03:11,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-13 04:03:11,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-13 04:03:11,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-13 04:03:11,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=2650, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 04:03:11,934 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 53 states. [2018-04-13 04:03:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:03:14,804 INFO L93 Difference]: Finished difference Result 544 states and 566 transitions. [2018-04-13 04:03:14,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-13 04:03:14,804 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 124 [2018-04-13 04:03:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:03:14,805 INFO L225 Difference]: With dead ends: 544 [2018-04-13 04:03:14,805 INFO L226 Difference]: Without dead ends: 544 [2018-04-13 04:03:14,805 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=401, Invalid=10105, Unknown=0, NotChecked=0, Total=10506 [2018-04-13 04:03:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-04-13 04:03:14,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 248. [2018-04-13 04:03:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:03:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:03:14,807 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:03:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:03:14,807 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:03:14,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-13 04:03:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:03:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:03:14,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:03:14,807 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:03:14,807 INFO L408 AbstractCegarLoop]: === Iteration 258 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:03:14,807 INFO L82 PathProgramCache]: Analyzing trace with hash 919309676, now seen corresponding path program 174 times [2018-04-13 04:03:14,807 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:03:14,807 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:03:14,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:14,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:03:14,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:14,817 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:03:14,822 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:03:14,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:03:14,822 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:03:14,823 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:03:14,887 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-04-13 04:03:14,887 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:03:14,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:03:14,920 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-13 04:03:14,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:14,924 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-13 04:03:14,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:14,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:14,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:03:14,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:14,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:14,936 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-13 04:03:14,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:14,941 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-13 04:03:14,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:14,944 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-13 04:03:14,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:03:15,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-13 04:03:15,001 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 5 treesize of output 1 [2018-04-13 04:03:15,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:15,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:15,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:03:15,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:21 [2018-04-13 04:03:15,141 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 11 treesize of output 1 [2018-04-13 04:03:15,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:15,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:15,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-13 04:03:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 0 proven. 778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:03:15,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:03:15,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-13 04:03:15,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-13 04:03:15,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-13 04:03:15,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2447, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 04:03:15,895 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 51 states. [2018-04-13 04:03:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:03:18,671 INFO L93 Difference]: Finished difference Result 634 states and 656 transitions. [2018-04-13 04:03:18,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 04:03:18,671 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 124 [2018-04-13 04:03:18,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:03:18,671 INFO L225 Difference]: With dead ends: 634 [2018-04-13 04:03:18,672 INFO L226 Difference]: Without dead ends: 634 [2018-04-13 04:03:18,672 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=374, Invalid=8938, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 04:03:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-04-13 04:03:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 248. [2018-04-13 04:03:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:03:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:03:18,673 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:03:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:03:18,673 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:03:18,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-13 04:03:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:03:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:03:18,674 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:03:18,674 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:03:18,674 INFO L408 AbstractCegarLoop]: === Iteration 259 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:03:18,674 INFO L82 PathProgramCache]: Analyzing trace with hash -333670717, now seen corresponding path program 175 times [2018-04-13 04:03:18,674 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:03:18,674 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:03:18,674 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:18,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:03:18,675 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:18,684 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:03:18,687 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:03:18,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:03:18,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:03:18,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:03:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:18,741 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:03:18,743 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-13 04:03:18,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:18,746 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-13 04:03:18,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:18,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:18,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:03:18,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:18,757 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-13 04:03:18,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:18,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:18,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:18,763 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-13 04:03:18,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:18,767 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-13 04:03:18,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:03:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:03:20,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:03:20,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-13 04:03:20,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 04:03:20,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 04:03:20,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 04:03:20,618 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 50 states. [2018-04-13 04:03:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:03:25,149 INFO L93 Difference]: Finished difference Result 719 states and 741 transitions. [2018-04-13 04:03:25,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-13 04:03:25,149 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 124 [2018-04-13 04:03:25,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:03:25,149 INFO L225 Difference]: With dead ends: 719 [2018-04-13 04:03:25,149 INFO L226 Difference]: Without dead ends: 719 [2018-04-13 04:03:25,150 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=378, Invalid=9128, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 04:03:25,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-04-13 04:03:25,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 248. [2018-04-13 04:03:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:03:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:03:25,152 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:03:25,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:03:25,152 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:03:25,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 04:03:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:03:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:03:25,152 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:03:25,152 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:03:25,152 INFO L408 AbstractCegarLoop]: === Iteration 260 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:03:25,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1042099444, now seen corresponding path program 176 times [2018-04-13 04:03:25,152 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:03:25,153 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:03:25,153 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:25,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:03:25,153 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:25,163 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:03:25,166 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:03:25,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:03:25,166 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:03:25,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:03:25,191 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:03:25,191 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:03:25,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:03:25,197 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-13 04:03:25,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:25,201 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-13 04:03:25,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:25,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:25,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:03:25,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:25,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:25,212 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-13 04:03:25,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:25,217 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-13 04:03:25,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:25,220 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-13 04:03:25,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:03:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:03:27,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:03:27,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-13 04:03:27,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-13 04:03:27,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-13 04:03:27,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 04:03:27,073 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 49 states. [2018-04-13 04:03:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:03:31,541 INFO L93 Difference]: Finished difference Result 799 states and 821 transitions. [2018-04-13 04:03:31,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 04:03:31,542 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 124 [2018-04-13 04:03:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:03:31,542 INFO L225 Difference]: With dead ends: 799 [2018-04-13 04:03:31,542 INFO L226 Difference]: Without dead ends: 799 [2018-04-13 04:03:31,543 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=359, Invalid=8571, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 04:03:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-04-13 04:03:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 248. [2018-04-13 04:03:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:03:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:03:31,545 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:03:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:03:31,545 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:03:31,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-13 04:03:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:03:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:03:31,545 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:03:31,545 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:03:31,545 INFO L408 AbstractCegarLoop]: === Iteration 261 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:03:31,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1615311581, now seen corresponding path program 177 times [2018-04-13 04:03:31,545 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:03:31,545 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:03:31,546 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:31,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:03:31,546 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:31,556 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:03:31,559 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:03:31,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:03:31,559 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:03:31,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:03:31,647 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-04-13 04:03:31,647 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:03:31,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:03:31,656 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-13 04:03:31,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:31,664 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-13 04:03:31,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:31,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:31,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:03:31,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:31,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:31,675 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-13 04:03:31,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:31,680 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-13 04:03:31,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:31,683 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-13 04:03:31,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:03:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:03:32,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:03:32,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-13 04:03:32,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-13 04:03:32,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-13 04:03:32,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 04:03:32,522 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 47 states. [2018-04-13 04:03:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:03:35,091 INFO L93 Difference]: Finished difference Result 874 states and 896 transitions. [2018-04-13 04:03:35,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 04:03:35,092 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 124 [2018-04-13 04:03:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:03:35,092 INFO L225 Difference]: With dead ends: 874 [2018-04-13 04:03:35,092 INFO L226 Difference]: Without dead ends: 874 [2018-04-13 04:03:35,093 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=345, Invalid=7845, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 04:03:35,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-04-13 04:03:35,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 248. [2018-04-13 04:03:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:03:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:03:35,094 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:03:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:03:35,094 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:03:35,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-13 04:03:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:03:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:03:35,095 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:03:35,095 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:03:35,095 INFO L408 AbstractCegarLoop]: === Iteration 262 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:03:35,095 INFO L82 PathProgramCache]: Analyzing trace with hash -223960916, now seen corresponding path program 178 times [2018-04-13 04:03:35,095 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:03:35,095 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:03:35,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:35,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:03:35,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:35,106 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:03:35,108 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:03:35,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:03:35,109 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:03:35,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:03:35,151 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:03:35,151 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:03:35,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:03:35,160 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-13 04:03:35,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:35,164 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-13 04:03:35,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:35,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:35,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:03:35,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:35,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:35,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:03:35,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:35,180 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-13 04:03:35,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:35,183 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-13 04:03:35,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:03:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 0 proven. 582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:03:38,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:03:38,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 04:03:38,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 04:03:38,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 04:03:38,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 04:03:38,107 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 45 states. [2018-04-13 04:03:41,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:03:41,808 INFO L93 Difference]: Finished difference Result 944 states and 966 transitions. [2018-04-13 04:03:41,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 04:03:41,808 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 124 [2018-04-13 04:03:41,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:03:41,808 INFO L225 Difference]: With dead ends: 944 [2018-04-13 04:03:41,808 INFO L226 Difference]: Without dead ends: 944 [2018-04-13 04:03:41,809 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=318, Invalid=6992, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 04:03:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-04-13 04:03:41,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 248. [2018-04-13 04:03:41,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:03:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:03:41,810 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:03:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:03:41,811 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:03:41,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 04:03:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:03:41,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:03:41,811 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:03:41,811 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:03:41,811 INFO L408 AbstractCegarLoop]: === Iteration 263 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:03:41,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1710390147, now seen corresponding path program 179 times [2018-04-13 04:03:41,811 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:03:41,811 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:03:41,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:41,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:03:41,812 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:41,822 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:03:41,824 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:03:41,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:03:41,825 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:03:41,825 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:03:41,877 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-04-13 04:03:41,878 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:03:41,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:03:41,886 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-13 04:03:41,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:41,893 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-13 04:03:41,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:41,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:41,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:03:41,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:41,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:41,905 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 17 treesize of output 24 [2018-04-13 04:03:41,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:41,911 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-13 04:03:41,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:41,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:03:41,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 04:03:42,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 04:03:42,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:42,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:42,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 04:03:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:03:42,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:03:42,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-13 04:03:42,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-13 04:03:42,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-13 04:03:42,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2067, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 04:03:42,916 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 47 states. [2018-04-13 04:03:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:03:46,523 INFO L93 Difference]: Finished difference Result 1009 states and 1031 transitions. [2018-04-13 04:03:46,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 04:03:46,523 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 124 [2018-04-13 04:03:46,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:03:46,524 INFO L225 Difference]: With dead ends: 1009 [2018-04-13 04:03:46,524 INFO L226 Difference]: Without dead ends: 1009 [2018-04-13 04:03:46,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=344, Invalid=7846, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 04:03:46,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-04-13 04:03:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 248. [2018-04-13 04:03:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:03:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:03:46,527 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:03:46,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:03:46,527 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:03:46,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-13 04:03:46,527 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:03:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:03:46,527 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:03:46,527 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:03:46,527 INFO L408 AbstractCegarLoop]: === Iteration 264 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:03:46,527 INFO L82 PathProgramCache]: Analyzing trace with hash 362870348, now seen corresponding path program 180 times [2018-04-13 04:03:46,527 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:03:46,528 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:03:46,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:46,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:03:46,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:46,540 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:03:46,543 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:03:46,543 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:03:46,543 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:03:46,543 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:03:46,673 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-04-13 04:03:46,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:03:46,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:03:46,687 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-13 04:03:46,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:46,691 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-13 04:03:46,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:46,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:46,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:03:46,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:46,703 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-13 04:03:46,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:46,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:46,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:46,708 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-13 04:03:46,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:46,712 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-13 04:03:46,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:03:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:03:47,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:03:47,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-13 04:03:47,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 04:03:47,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 04:03:47,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 04:03:47,446 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 44 states. [2018-04-13 04:03:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:03:49,950 INFO L93 Difference]: Finished difference Result 1069 states and 1091 transitions. [2018-04-13 04:03:49,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 04:03:49,950 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 124 [2018-04-13 04:03:49,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:03:49,951 INFO L225 Difference]: With dead ends: 1069 [2018-04-13 04:03:49,951 INFO L226 Difference]: Without dead ends: 1069 [2018-04-13 04:03:49,952 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=315, Invalid=6825, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 04:03:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-04-13 04:03:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 248. [2018-04-13 04:03:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:03:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:03:49,954 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:03:49,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:03:49,954 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:03:49,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 04:03:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:03:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:03:49,955 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:03:49,955 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:03:49,955 INFO L408 AbstractCegarLoop]: === Iteration 265 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:03:49,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1006558749, now seen corresponding path program 181 times [2018-04-13 04:03:49,955 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:03:49,955 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:03:49,955 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:49,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:03:49,955 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:49,967 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:03:49,970 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:03:49,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:03:49,970 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:03:49,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:03:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:50,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:03:50,029 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-13 04:03:50,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:50,032 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-13 04:03:50,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:50,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:50,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:03:50,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:50,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:50,044 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-13 04:03:50,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:50,048 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-13 04:03:50,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:50,051 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-13 04:03:50,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:03:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:03:50,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:03:50,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 04:03:50,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 04:03:50,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 04:03:50,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 04:03:50,711 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 43 states. [2018-04-13 04:03:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:03:53,075 INFO L93 Difference]: Finished difference Result 1124 states and 1146 transitions. [2018-04-13 04:03:53,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 04:03:53,075 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 124 [2018-04-13 04:03:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:03:53,076 INFO L225 Difference]: With dead ends: 1124 [2018-04-13 04:03:53,076 INFO L226 Difference]: Without dead ends: 1124 [2018-04-13 04:03:53,076 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=297, Invalid=6345, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 04:03:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2018-04-13 04:03:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 248. [2018-04-13 04:03:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:03:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:03:53,079 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:03:53,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:03:53,079 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:03:53,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 04:03:53,079 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:03:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:03:53,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:03:53,079 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:03:53,079 INFO L408 AbstractCegarLoop]: === Iteration 266 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:03:53,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1143221268, now seen corresponding path program 182 times [2018-04-13 04:03:53,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:03:53,080 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:03:53,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:53,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:03:53,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:53,092 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:03:53,096 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:03:53,096 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:03:53,096 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:03:53,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:03:53,175 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:03:53,175 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:03:53,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:03:53,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:03:53,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:53,194 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-13 04:03:53,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:53,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:53,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:03:53,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:53,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:03:53,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:53,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:53,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:53,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:03:53,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:53,220 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-13 04:03:53,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:03:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:03:54,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:03:54,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 04:03:54,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 04:03:54,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 04:03:54,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 04:03:54,292 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 43 states. [2018-04-13 04:03:57,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:03:57,594 INFO L93 Difference]: Finished difference Result 1174 states and 1196 transitions. [2018-04-13 04:03:57,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 04:03:57,594 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 124 [2018-04-13 04:03:57,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:03:57,595 INFO L225 Difference]: With dead ends: 1174 [2018-04-13 04:03:57,595 INFO L226 Difference]: Without dead ends: 1174 [2018-04-13 04:03:57,596 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=299, Invalid=6507, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 04:03:57,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2018-04-13 04:03:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 248. [2018-04-13 04:03:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:03:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:03:57,598 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:03:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:03:57,598 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:03:57,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 04:03:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:03:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:03:57,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:03:57,598 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:03:57,598 INFO L408 AbstractCegarLoop]: === Iteration 267 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:03:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash 714752067, now seen corresponding path program 183 times [2018-04-13 04:03:57,599 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:03:57,599 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:03:57,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:57,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:03:57,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:03:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:03:57,611 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:03:57,614 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:03:57,614 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:03:57,614 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:03:57,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:03:57,782 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-04-13 04:03:57,783 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:03:57,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:03:57,803 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-13 04:03:57,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:57,808 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-13 04:03:57,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:57,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:03:57,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:03:57,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:57,819 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-13 04:03:57,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:57,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:57,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:03:57,826 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-13 04:03:57,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:03:57,829 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-13 04:03:57,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:03:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:03:58,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:03:58,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 04:03:58,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 04:03:58,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 04:03:58,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:03:58,392 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 40 states. [2018-04-13 04:04:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:00,528 INFO L93 Difference]: Finished difference Result 1219 states and 1241 transitions. [2018-04-13 04:04:00,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 04:04:00,528 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 124 [2018-04-13 04:04:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:00,529 INFO L225 Difference]: With dead ends: 1219 [2018-04-13 04:04:00,529 INFO L226 Difference]: Without dead ends: 1219 [2018-04-13 04:04:00,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=268, Invalid=5432, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 04:04:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-04-13 04:04:00,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 248. [2018-04-13 04:04:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:04:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:04:00,531 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:04:00,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:00,531 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:04:00,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 04:04:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:04:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:04:00,531 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:00,532 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:00,532 INFO L408 AbstractCegarLoop]: === Iteration 268 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:00,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1524709772, now seen corresponding path program 184 times [2018-04-13 04:04:00,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:00,532 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:00,532 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:00,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:04:00,532 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:00,544 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:00,546 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:00,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:00,546 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:00,547 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:04:00,601 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:04:00,601 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:04:00,610 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:00,611 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-13 04:04:00,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:00,615 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-13 04:04:00,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:00,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:00,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:00,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:00,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:00,627 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-13 04:04:00,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:00,632 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-13 04:04:00,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:00,635 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-13 04:04:00,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:04:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:04:01,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:04:01,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-13 04:04:01,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 04:04:01,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 04:04:01,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 04:04:01,193 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 39 states. [2018-04-13 04:04:03,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:03,601 INFO L93 Difference]: Finished difference Result 1259 states and 1281 transitions. [2018-04-13 04:04:03,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 04:04:03,601 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 124 [2018-04-13 04:04:03,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:03,602 INFO L225 Difference]: With dead ends: 1259 [2018-04-13 04:04:03,602 INFO L226 Difference]: Without dead ends: 1259 [2018-04-13 04:04:03,602 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=258, Invalid=5144, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 04:04:03,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2018-04-13 04:04:03,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 248. [2018-04-13 04:04:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:04:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:04:03,604 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:04:03,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:03,604 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:04:03,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 04:04:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:04:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:04:03,605 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:03,605 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:03,605 INFO L408 AbstractCegarLoop]: === Iteration 269 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:03,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1442043555, now seen corresponding path program 185 times [2018-04-13 04:04:03,605 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:03,605 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:03,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:03,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:04:03,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:03,619 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:03,621 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:03,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:03,621 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:03,622 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:04:03,697 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-04-13 04:04:03,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:04:03,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:03,709 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-13 04:04:03,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:03,713 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-13 04:04:03,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:03,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:03,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:03,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:03,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:03,724 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-13 04:04:03,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:03,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:04:03,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:03,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:04:03,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 04:04:04,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 04:04:04,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:04,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:04,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2018-04-13 04:04:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:04:04,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:04:04,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 04:04:04,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 04:04:04,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 04:04:04,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 04:04:04,592 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 38 states. [2018-04-13 04:04:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:07,790 INFO L93 Difference]: Finished difference Result 1294 states and 1316 transitions. [2018-04-13 04:04:07,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 04:04:07,790 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 124 [2018-04-13 04:04:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:07,791 INFO L225 Difference]: With dead ends: 1294 [2018-04-13 04:04:07,791 INFO L226 Difference]: Without dead ends: 1294 [2018-04-13 04:04:07,791 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=253, Invalid=5003, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 04:04:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2018-04-13 04:04:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 248. [2018-04-13 04:04:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:04:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:04:07,793 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:04:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:07,793 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:04:07,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 04:04:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:04:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:04:07,793 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:07,793 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:07,793 INFO L408 AbstractCegarLoop]: === Iteration 270 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:07,793 INFO L82 PathProgramCache]: Analyzing trace with hash -323279060, now seen corresponding path program 186 times [2018-04-13 04:04:07,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:07,794 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:07,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:07,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:04:07,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:07,806 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:07,809 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:07,809 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:07,809 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:07,809 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:04:07,899 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-04-13 04:04:07,899 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:04:07,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:07,912 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-13 04:04:07,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:07,915 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-13 04:04:07,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:07,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:07,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:07,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:07,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:07,927 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-13 04:04:07,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:07,932 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-13 04:04:07,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:07,935 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-13 04:04:07,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:04:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:04:08,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:04:08,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 04:04:08,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 04:04:08,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 04:04:08,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 04:04:08,434 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 37 states. [2018-04-13 04:04:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:10,447 INFO L93 Difference]: Finished difference Result 1324 states and 1346 transitions. [2018-04-13 04:04:10,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 04:04:10,448 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 124 [2018-04-13 04:04:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:10,448 INFO L225 Difference]: With dead ends: 1324 [2018-04-13 04:04:10,448 INFO L226 Difference]: Without dead ends: 1324 [2018-04-13 04:04:10,449 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=238, Invalid=4592, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 04:04:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2018-04-13 04:04:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 248. [2018-04-13 04:04:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:04:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:04:10,451 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:04:10,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:10,451 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:04:10,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 04:04:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:04:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:04:10,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:10,451 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:10,451 INFO L408 AbstractCegarLoop]: === Iteration 271 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1379670781, now seen corresponding path program 187 times [2018-04-13 04:04:10,451 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:10,451 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:10,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:10,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:04:10,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:10,465 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:10,468 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:10,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:10,468 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:10,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:04:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:10,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:10,559 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-13 04:04:10,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:10,562 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-13 04:04:10,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:10,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:10,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:10,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:10,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:10,574 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-13 04:04:10,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:10,579 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-13 04:04:10,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:10,582 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-13 04:04:10,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:04:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 0 proven. 726 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:04:11,083 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:04:11,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 04:04:11,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 04:04:11,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 04:04:11,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 04:04:11,083 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 37 states. [2018-04-13 04:04:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:13,190 INFO L93 Difference]: Finished difference Result 1349 states and 1371 transitions. [2018-04-13 04:04:13,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 04:04:13,190 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 124 [2018-04-13 04:04:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:13,191 INFO L225 Difference]: With dead ends: 1349 [2018-04-13 04:04:13,191 INFO L226 Difference]: Without dead ends: 1349 [2018-04-13 04:04:13,191 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=4591, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 04:04:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2018-04-13 04:04:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 248. [2018-04-13 04:04:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:04:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:04:13,194 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:04:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:13,194 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:04:13,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 04:04:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:04:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:04:13,194 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:13,194 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:13,194 INFO L408 AbstractCegarLoop]: === Iteration 272 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:13,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1879860020, now seen corresponding path program 188 times [2018-04-13 04:04:13,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:13,195 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:13,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:13,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:04:13,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:13,209 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:13,212 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:13,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:13,212 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:13,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:04:13,264 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:04:13,264 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:04:13,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:13,280 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-13 04:04:13,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:13,284 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-13 04:04:13,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:13,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:13,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:13,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:13,303 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-13 04:04:13,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:13,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:13,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:13,310 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-13 04:04:13,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:13,313 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-13 04:04:13,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:04:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:04:13,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:04:13,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 04:04:13,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 04:04:13,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 04:04:13,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 04:04:13,814 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 35 states. [2018-04-13 04:04:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:15,998 INFO L93 Difference]: Finished difference Result 1369 states and 1391 transitions. [2018-04-13 04:04:15,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 04:04:15,998 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 124 [2018-04-13 04:04:15,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:15,999 INFO L225 Difference]: With dead ends: 1369 [2018-04-13 04:04:15,999 INFO L226 Difference]: Without dead ends: 1369 [2018-04-13 04:04:15,999 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=214, Invalid=4076, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 04:04:16,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2018-04-13 04:04:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 248. [2018-04-13 04:04:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:04:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:04:16,001 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:04:16,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:16,002 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:04:16,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 04:04:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:04:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:04:16,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:16,002 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:16,002 INFO L408 AbstractCegarLoop]: === Iteration 273 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:16,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1522504861, now seen corresponding path program 189 times [2018-04-13 04:04:16,002 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:16,002 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:16,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:16,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:04:16,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:16,016 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:16,019 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:16,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:16,019 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:16,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:04:16,104 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-04-13 04:04:16,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:04:16,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:16,121 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-13 04:04:16,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:16,124 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-13 04:04:16,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:16,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:16,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:16,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:16,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:16,136 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-13 04:04:16,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:16,141 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-13 04:04:16,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:16,144 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-13 04:04:16,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:04:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:04:16,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:04:16,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 04:04:16,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 04:04:16,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 04:04:16,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 04:04:16,597 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 35 states. [2018-04-13 04:04:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:18,545 INFO L93 Difference]: Finished difference Result 1384 states and 1406 transitions. [2018-04-13 04:04:18,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 04:04:18,545 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 124 [2018-04-13 04:04:18,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:18,546 INFO L225 Difference]: With dead ends: 1384 [2018-04-13 04:04:18,546 INFO L226 Difference]: Without dead ends: 1384 [2018-04-13 04:04:18,546 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=217, Invalid=4073, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 04:04:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2018-04-13 04:04:18,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 248. [2018-04-13 04:04:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:04:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:04:18,548 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:04:18,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:18,548 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:04:18,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 04:04:18,548 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:04:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:04:18,549 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:18,549 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:18,549 INFO L408 AbstractCegarLoop]: === Iteration 274 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash 664050284, now seen corresponding path program 190 times [2018-04-13 04:04:18,549 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:18,549 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:18,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:18,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:04:18,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:18,564 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:18,567 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:18,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:18,567 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:18,567 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:04:18,644 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:04:18,645 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:04:18,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:18,659 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-13 04:04:18,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:18,662 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-13 04:04:18,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:18,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:18,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:18,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:18,674 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-13 04:04:18,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:18,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:18,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:18,685 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-13 04:04:18,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:18,688 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-13 04:04:18,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:04:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:04:19,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:04:19,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 04:04:19,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 04:04:19,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 04:04:19,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 04:04:19,147 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 34 states. [2018-04-13 04:04:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:21,165 INFO L93 Difference]: Finished difference Result 1395 states and 1417 transitions. [2018-04-13 04:04:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 04:04:21,165 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 124 [2018-04-13 04:04:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:21,166 INFO L225 Difference]: With dead ends: 1395 [2018-04-13 04:04:21,166 INFO L226 Difference]: Without dead ends: 1395 [2018-04-13 04:04:21,166 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=3949, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 04:04:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2018-04-13 04:04:21,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 248. [2018-04-13 04:04:21,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 04:04:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-04-13 04:04:21,168 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 124 [2018-04-13 04:04:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:21,168 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-04-13 04:04:21,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 04:04:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-04-13 04:04:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:04:21,169 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:21,169 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:21,169 INFO L408 AbstractCegarLoop]: === Iteration 275 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:21,169 INFO L82 PathProgramCache]: Analyzing trace with hash 455043523, now seen corresponding path program 20 times [2018-04-13 04:04:21,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:21,169 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:21,169 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:21,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:04:21,169 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:21,187 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:21,192 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:21,193 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:21,193 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:21,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:04:21,233 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:04:21,233 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:04:21,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:21,259 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-13 04:04:21,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:21,264 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-13 04:04:21,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:21,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:21,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:21,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:21,275 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-13 04:04:21,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:21,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:21,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:21,280 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-13 04:04:21,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:21,283 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-13 04:04:21,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:04:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 0 proven. 1050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:04:21,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:04:21,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-13 04:04:21,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 04:04:21,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 04:04:21,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-04-13 04:04:21,639 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 32 states. [2018-04-13 04:04:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:23,406 INFO L93 Difference]: Finished difference Result 1408 states and 1431 transitions. [2018-04-13 04:04:23,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 04:04:23,406 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 124 [2018-04-13 04:04:23,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:23,407 INFO L225 Difference]: With dead ends: 1408 [2018-04-13 04:04:23,407 INFO L226 Difference]: Without dead ends: 1408 [2018-04-13 04:04:23,407 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=3356, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 04:04:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-04-13 04:04:23,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 249. [2018-04-13 04:04:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-13 04:04:23,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 272 transitions. [2018-04-13 04:04:23,409 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 272 transitions. Word has length 124 [2018-04-13 04:04:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:23,410 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 272 transitions. [2018-04-13 04:04:23,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 04:04:23,410 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 272 transitions. [2018-04-13 04:04:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:04:23,410 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:23,410 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:23,410 INFO L408 AbstractCegarLoop]: === Iteration 276 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:23,410 INFO L82 PathProgramCache]: Analyzing trace with hash 472932893, now seen corresponding path program 21 times [2018-04-13 04:04:23,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:23,410 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:23,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:23,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:04:23,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:23,426 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:23,428 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:23,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:23,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:23,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:04:23,569 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-13 04:04:23,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:04:23,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:23,591 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-13 04:04:23,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:23,594 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-13 04:04:23,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:23,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:23,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:23,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:23,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:23,605 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-13 04:04:23,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:23,609 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-13 04:04:23,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:23,612 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-13 04:04:23,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:04:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:04:23,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:04:23,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-13 04:04:23,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 04:04:23,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 04:04:23,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-04-13 04:04:23,946 INFO L87 Difference]: Start difference. First operand 249 states and 272 transitions. Second operand 30 states. [2018-04-13 04:04:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:25,521 INFO L93 Difference]: Finished difference Result 1410 states and 1434 transitions. [2018-04-13 04:04:25,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 04:04:25,521 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 124 [2018-04-13 04:04:25,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:25,522 INFO L225 Difference]: With dead ends: 1410 [2018-04-13 04:04:25,522 INFO L226 Difference]: Without dead ends: 1410 [2018-04-13 04:04:25,522 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=2914, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 04:04:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2018-04-13 04:04:25,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 253. [2018-04-13 04:04:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-04-13 04:04:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 276 transitions. [2018-04-13 04:04:25,524 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 276 transitions. Word has length 124 [2018-04-13 04:04:25,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:25,524 INFO L459 AbstractCegarLoop]: Abstraction has 253 states and 276 transitions. [2018-04-13 04:04:25,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 04:04:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 276 transitions. [2018-04-13 04:04:25,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:04:25,525 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:25,525 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:25,525 INFO L408 AbstractCegarLoop]: === Iteration 277 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1818414744, now seen corresponding path program 21 times [2018-04-13 04:04:25,525 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:25,525 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:25,525 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:25,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:04:25,525 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:25,534 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:25,540 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:25,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:25,540 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:25,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:04:25,579 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-13 04:04:25,579 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:04:25,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:25,588 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-13 04:04:25,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:25,592 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-13 04:04:25,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:25,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:25,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:25,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:25,603 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-13 04:04:25,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:25,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:25,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:25,610 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-13 04:04:25,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:25,617 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-13 04:04:25,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:04:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:04:26,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:04:26,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-13 04:04:26,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-13 04:04:26,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-13 04:04:26,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 04:04:26,628 INFO L87 Difference]: Start difference. First operand 253 states and 276 transitions. Second operand 54 states. [2018-04-13 04:04:29,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:29,181 INFO L93 Difference]: Finished difference Result 364 states and 387 transitions. [2018-04-13 04:04:29,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-13 04:04:29,181 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 129 [2018-04-13 04:04:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:29,181 INFO L225 Difference]: With dead ends: 364 [2018-04-13 04:04:29,181 INFO L226 Difference]: Without dead ends: 364 [2018-04-13 04:04:29,182 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=404, Invalid=10308, Unknown=0, NotChecked=0, Total=10712 [2018-04-13 04:04:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-04-13 04:04:29,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 258. [2018-04-13 04:04:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:04:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:04:29,183 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:04:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:29,183 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:04:29,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-13 04:04:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:04:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:04:29,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:29,184 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:29,184 INFO L408 AbstractCegarLoop]: === Iteration 278 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:29,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1382658753, now seen corresponding path program 191 times [2018-04-13 04:04:29,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:29,184 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:29,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:29,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:04:29,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:29,193 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:29,211 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:29,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:29,211 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:29,212 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:04:29,271 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-04-13 04:04:29,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:04:29,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:29,280 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-13 04:04:29,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:29,283 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-13 04:04:29,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:29,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:29,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:29,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:29,295 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-13 04:04:29,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:29,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:29,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:29,303 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-13 04:04:29,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:29,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:04:29,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 04:04:30,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 04:04:30,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:30,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:30,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2018-04-13 04:04:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:04:30,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:04:30,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-13 04:04:30,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-13 04:04:30,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-13 04:04:30,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2860, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 04:04:30,891 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 55 states. [2018-04-13 04:04:35,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:35,364 INFO L93 Difference]: Finished difference Result 469 states and 492 transitions. [2018-04-13 04:04:35,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-13 04:04:35,364 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 129 [2018-04-13 04:04:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:35,365 INFO L225 Difference]: With dead ends: 469 [2018-04-13 04:04:35,365 INFO L226 Difference]: Without dead ends: 469 [2018-04-13 04:04:35,365 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=421, Invalid=10921, Unknown=0, NotChecked=0, Total=11342 [2018-04-13 04:04:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-04-13 04:04:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 258. [2018-04-13 04:04:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:04:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:04:35,367 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:04:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:35,367 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:04:35,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-13 04:04:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:04:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:04:35,367 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:35,367 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:35,367 INFO L408 AbstractCegarLoop]: === Iteration 279 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash -94900086, now seen corresponding path program 192 times [2018-04-13 04:04:35,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:35,368 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:35,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:35,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:04:35,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:35,377 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:35,384 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:35,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:35,384 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:35,384 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:04:35,428 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-04-13 04:04:35,428 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:04:35,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:35,439 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-13 04:04:35,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:35,442 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-13 04:04:35,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:35,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:35,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:35,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:35,459 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-13 04:04:35,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:35,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:35,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:35,465 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-13 04:04:35,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:35,468 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-13 04:04:35,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:04:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:04:36,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:04:36,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-13 04:04:36,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-13 04:04:36,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-13 04:04:36,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2755, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 04:04:36,523 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 54 states. [2018-04-13 04:04:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:39,414 INFO L93 Difference]: Finished difference Result 569 states and 592 transitions. [2018-04-13 04:04:39,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-13 04:04:39,414 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 129 [2018-04-13 04:04:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:39,415 INFO L225 Difference]: With dead ends: 569 [2018-04-13 04:04:39,415 INFO L226 Difference]: Without dead ends: 569 [2018-04-13 04:04:39,415 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=410, Invalid=10510, Unknown=0, NotChecked=0, Total=10920 [2018-04-13 04:04:39,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-04-13 04:04:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 258. [2018-04-13 04:04:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:04:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:04:39,417 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:04:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:39,417 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:04:39,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-13 04:04:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:04:39,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:04:39,417 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:39,417 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:39,418 INFO L408 AbstractCegarLoop]: === Iteration 280 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:39,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1570080479, now seen corresponding path program 193 times [2018-04-13 04:04:39,418 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:39,418 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:39,418 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:39,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:04:39,418 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:39,428 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:39,433 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:39,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:39,434 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:39,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:04:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:39,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:39,496 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-13 04:04:39,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:39,501 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-13 04:04:39,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:39,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:39,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:39,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:39,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:39,512 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-13 04:04:39,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:39,517 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-13 04:04:39,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:39,520 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-13 04:04:39,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:04:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 0 proven. 867 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:04:40,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:04:40,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-13 04:04:40,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-13 04:04:40,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-13 04:04:40,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 04:04:40,451 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 51 states. [2018-04-13 04:04:43,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:04:43,067 INFO L93 Difference]: Finished difference Result 664 states and 687 transitions. [2018-04-13 04:04:43,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-13 04:04:43,067 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 129 [2018-04-13 04:04:43,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:04:43,067 INFO L225 Difference]: With dead ends: 664 [2018-04-13 04:04:43,067 INFO L226 Difference]: Without dead ends: 664 [2018-04-13 04:04:43,068 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=374, Invalid=9132, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 04:04:43,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-04-13 04:04:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 258. [2018-04-13 04:04:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:04:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:04:43,069 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:04:43,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:04:43,070 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:04:43,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-13 04:04:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:04:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:04:43,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:04:43,070 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:04:43,070 INFO L408 AbstractCegarLoop]: === Iteration 281 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:04:43,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2016629206, now seen corresponding path program 194 times [2018-04-13 04:04:43,070 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:04:43,070 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:04:43,070 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:43,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:04:43,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:04:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:04:43,081 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:04:43,084 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:04:43,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:04:43,084 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:04:43,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:04:43,117 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:04:43,118 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:04:43,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:04:43,126 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-13 04:04:43,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:43,129 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-13 04:04:43,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:43,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:43,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:04:43,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:43,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:04:43,142 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-13 04:04:43,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:43,149 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-13 04:04:43,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:43,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:43,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-13 04:04:43,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:04:43,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:04:43,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:04:43,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:16 [2018-04-13 04:04:46,075 WARN L148 SmtUtils]: Spent 989ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-13 04:05:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 0 proven. 798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:05:23,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:05:23,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-13 04:05:23,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-13 04:05:23,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-13 04:05:23,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2647, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 04:05:23,922 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 53 states. [2018-04-13 04:05:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:05:30,493 INFO L93 Difference]: Finished difference Result 754 states and 777 transitions. [2018-04-13 04:05:30,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-13 04:05:30,493 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 129 [2018-04-13 04:05:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:05:30,493 INFO L225 Difference]: With dead ends: 754 [2018-04-13 04:05:30,493 INFO L226 Difference]: Without dead ends: 754 [2018-04-13 04:05:30,494 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=430, Invalid=9670, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 04:05:30,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-04-13 04:05:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 258. [2018-04-13 04:05:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:05:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:05:30,495 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:05:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:05:30,496 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:05:30,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-13 04:05:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:05:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:05:30,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:05:30,496 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:05:30,496 INFO L408 AbstractCegarLoop]: === Iteration 282 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:05:30,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1025357697, now seen corresponding path program 195 times [2018-04-13 04:05:30,496 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:05:30,496 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:05:30,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:30,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:05:30,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:05:30,507 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:05:30,509 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:05:30,509 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:05:30,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:05:30,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:05:30,581 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-04-13 04:05:30,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:05:30,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:05:30,593 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-13 04:05:30,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:30,597 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-13 04:05:30,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:30,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:05:30,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:05:30,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:30,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:30,608 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-13 04:05:30,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:30,613 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-13 04:05:30,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:30,616 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-13 04:05:30,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:05:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:05:31,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:05:31,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-13 04:05:31,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 04:05:31,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 04:05:31,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 04:05:31,488 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 50 states. [2018-04-13 04:05:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:05:34,191 INFO L93 Difference]: Finished difference Result 839 states and 862 transitions. [2018-04-13 04:05:34,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-13 04:05:34,192 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 129 [2018-04-13 04:05:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:05:34,192 INFO L225 Difference]: With dead ends: 839 [2018-04-13 04:05:34,192 INFO L226 Difference]: Without dead ends: 839 [2018-04-13 04:05:34,193 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=371, Invalid=8941, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 04:05:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-04-13 04:05:34,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 258. [2018-04-13 04:05:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:05:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:05:34,194 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:05:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:05:34,195 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:05:34,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 04:05:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:05:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:05:34,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:05:34,195 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:05:34,195 INFO L408 AbstractCegarLoop]: === Iteration 283 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:05:34,195 INFO L82 PathProgramCache]: Analyzing trace with hash 316928970, now seen corresponding path program 196 times [2018-04-13 04:05:34,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:05:34,195 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:05:34,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:34,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:05:34,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:05:34,206 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:05:34,208 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:05:34,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:05:34,208 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:05:34,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:05:34,241 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:05:34,242 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:05:34,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:05:34,249 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-13 04:05:34,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:34,252 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-13 04:05:34,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:34,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:05:34,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:05:34,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:34,263 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-13 04:05:34,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:34,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:34,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:34,268 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-13 04:05:34,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:34,271 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-13 04:05:34,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:05:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 690 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:05:35,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:05:35,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-13 04:05:35,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-13 04:05:35,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-13 04:05:35,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 04:05:35,061 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 48 states. [2018-04-13 04:05:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:05:37,618 INFO L93 Difference]: Finished difference Result 919 states and 942 transitions. [2018-04-13 04:05:37,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 04:05:37,618 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 129 [2018-04-13 04:05:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:05:37,619 INFO L225 Difference]: With dead ends: 919 [2018-04-13 04:05:37,619 INFO L226 Difference]: Without dead ends: 919 [2018-04-13 04:05:37,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=344, Invalid=8028, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 04:05:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-04-13 04:05:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 258. [2018-04-13 04:05:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:05:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:05:37,621 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:05:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:05:37,621 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:05:37,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-13 04:05:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:05:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:05:37,621 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:05:37,621 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:05:37,621 INFO L408 AbstractCegarLoop]: === Iteration 284 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:05:37,622 INFO L82 PathProgramCache]: Analyzing trace with hash -256283167, now seen corresponding path program 197 times [2018-04-13 04:05:37,622 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:05:37,622 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:05:37,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:37,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:05:37,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:05:37,632 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:05:37,635 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:05:37,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:05:37,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:05:37,635 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:05:37,693 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-04-13 04:05:37,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:05:37,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:05:37,700 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-13 04:05:37,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:37,703 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-13 04:05:37,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:37,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:05:37,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:05:37,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:37,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:37,715 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-13 04:05:37,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:37,722 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-13 04:05:37,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:37,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:05:37,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-13 04:05:38,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 04:05:38,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:38,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:05:38,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 04:05:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:05:38,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:05:38,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-13 04:05:38,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-13 04:05:38,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-13 04:05:38,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2254, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 04:05:38,802 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 49 states. [2018-04-13 04:05:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:05:42,649 INFO L93 Difference]: Finished difference Result 994 states and 1017 transitions. [2018-04-13 04:05:42,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 04:05:42,649 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 129 [2018-04-13 04:05:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:05:42,649 INFO L225 Difference]: With dead ends: 994 [2018-04-13 04:05:42,649 INFO L226 Difference]: Without dead ends: 994 [2018-04-13 04:05:42,650 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=361, Invalid=8569, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 04:05:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-04-13 04:05:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 258. [2018-04-13 04:05:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:05:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:05:42,652 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:05:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:05:42,652 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:05:42,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-13 04:05:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:05:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:05:42,652 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:05:42,652 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:05:42,652 INFO L408 AbstractCegarLoop]: === Iteration 285 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:05:42,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1135067498, now seen corresponding path program 198 times [2018-04-13 04:05:42,652 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:05:42,652 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:05:42,653 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:42,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:05:42,653 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:05:42,665 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:05:42,668 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:05:42,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:05:42,668 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:05:42,668 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:05:42,734 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-04-13 04:05:42,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:05:42,741 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:05:42,742 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-13 04:05:42,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:42,745 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-13 04:05:42,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:42,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:05:42,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:05:42,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:42,756 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-13 04:05:42,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:42,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:42,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:42,763 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-13 04:05:42,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:42,767 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-13 04:05:42,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:05:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 622 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:05:43,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:05:43,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-13 04:05:43,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-13 04:05:43,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-13 04:05:43,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 04:05:43,564 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 47 states. [2018-04-13 04:05:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:05:46,269 INFO L93 Difference]: Finished difference Result 1064 states and 1087 transitions. [2018-04-13 04:05:46,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 04:05:46,270 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 129 [2018-04-13 04:05:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:05:46,270 INFO L225 Difference]: With dead ends: 1064 [2018-04-13 04:05:46,270 INFO L226 Difference]: Without dead ends: 1064 [2018-04-13 04:05:46,271 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=341, Invalid=7849, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 04:05:46,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2018-04-13 04:05:46,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 258. [2018-04-13 04:05:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:05:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:05:46,272 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:05:46,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:05:46,273 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:05:46,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-13 04:05:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:05:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:05:46,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:05:46,273 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:05:46,273 INFO L408 AbstractCegarLoop]: === Iteration 286 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:05:46,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1225548735, now seen corresponding path program 199 times [2018-04-13 04:05:46,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:05:46,273 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:05:46,273 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:46,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:05:46,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:05:46,285 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:05:46,287 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:05:46,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:05:46,287 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:05:46,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:05:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:05:46,333 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:05:46,335 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-13 04:05:46,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:46,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:05:46,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:46,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:05:46,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:05:46,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:46,350 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-13 04:05:46,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:46,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:46,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:46,364 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-13 04:05:46,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:46,367 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-13 04:05:46,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:05:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 0 proven. 603 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:05:47,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:05:47,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 04:05:47,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 04:05:47,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 04:05:47,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 04:05:47,125 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 46 states. [2018-04-13 04:05:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:05:49,628 INFO L93 Difference]: Finished difference Result 1129 states and 1152 transitions. [2018-04-13 04:05:49,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 04:05:49,629 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 129 [2018-04-13 04:05:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:05:49,629 INFO L225 Difference]: With dead ends: 1129 [2018-04-13 04:05:49,629 INFO L226 Difference]: Without dead ends: 1129 [2018-04-13 04:05:49,630 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=323, Invalid=7333, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 04:05:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2018-04-13 04:05:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 258. [2018-04-13 04:05:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:05:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:05:49,632 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:05:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:05:49,632 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:05:49,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 04:05:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:05:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:05:49,633 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:05:49,633 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:05:49,633 INFO L408 AbstractCegarLoop]: === Iteration 287 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:05:49,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1721898762, now seen corresponding path program 200 times [2018-04-13 04:05:49,633 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:05:49,633 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:05:49,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:49,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:05:49,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:05:49,645 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:05:49,648 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:05:49,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:05:49,648 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:05:49,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:05:49,700 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:05:49,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:05:49,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:05:49,711 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-13 04:05:49,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:49,714 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-13 04:05:49,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:49,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:05:49,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:05:49,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:49,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:49,725 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-13 04:05:49,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:49,729 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-13 04:05:49,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:49,732 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-13 04:05:49,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:05:49,893 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 11 treesize of output 1 [2018-04-13 04:05:49,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:49,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:05:49,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2018-04-13 04:05:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:05:51,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:05:51,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 04:05:51,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 04:05:51,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 04:05:51,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1977, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 04:05:51,359 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 46 states. [2018-04-13 04:05:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:05:55,401 INFO L93 Difference]: Finished difference Result 1189 states and 1212 transitions. [2018-04-13 04:05:55,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 04:05:55,401 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 129 [2018-04-13 04:05:55,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:05:55,402 INFO L225 Difference]: With dead ends: 1189 [2018-04-13 04:05:55,402 INFO L226 Difference]: Without dead ends: 1189 [2018-04-13 04:05:55,402 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=318, Invalid=7164, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 04:05:55,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2018-04-13 04:05:55,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 258. [2018-04-13 04:05:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:05:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:05:55,404 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:05:55,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:05:55,404 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:05:55,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 04:05:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:05:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:05:55,405 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:05:55,405 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:05:55,405 INFO L408 AbstractCegarLoop]: === Iteration 288 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:05:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash 352469665, now seen corresponding path program 201 times [2018-04-13 04:05:55,405 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:05:55,405 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:05:55,405 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:55,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:05:55,405 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:05:55,417 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:05:55,420 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:05:55,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:05:55,420 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:05:55,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:05:55,499 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-04-13 04:05:55,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:05:55,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:05:55,510 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-13 04:05:55,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:55,513 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-13 04:05:55,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:55,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:05:55,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:05:55,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:55,524 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-13 04:05:55,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:55,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:55,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:55,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, 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-13 04:05:55,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:55,534 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-13 04:05:55,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:05:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:05:56,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:05:56,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 04:05:56,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 04:05:56,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 04:05:56,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1890, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 04:05:56,274 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 45 states. [2018-04-13 04:05:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:05:58,878 INFO L93 Difference]: Finished difference Result 1244 states and 1267 transitions. [2018-04-13 04:05:58,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 04:05:58,878 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 129 [2018-04-13 04:05:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:05:58,879 INFO L225 Difference]: With dead ends: 1244 [2018-04-13 04:05:58,879 INFO L226 Difference]: Without dead ends: 1244 [2018-04-13 04:05:58,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=332, Invalid=6808, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 04:05:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2018-04-13 04:05:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 258. [2018-04-13 04:05:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:05:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:05:58,881 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:05:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:05:58,881 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:05:58,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 04:05:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:05:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:05:58,882 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:05:58,882 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:05:58,882 INFO L408 AbstractCegarLoop]: === Iteration 289 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:05:58,882 INFO L82 PathProgramCache]: Analyzing trace with hash 215807146, now seen corresponding path program 202 times [2018-04-13 04:05:58,882 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:05:58,882 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:05:58,882 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:58,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:05:58,882 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:05:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:05:58,894 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:05:58,897 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:05:58,897 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:05:58,897 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:05:58,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:05:58,987 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:05:58,987 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:05:58,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:05:58,998 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-13 04:05:58,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:59,001 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-13 04:05:59,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:59,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:05:59,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:05:59,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:59,012 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-13 04:05:59,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:59,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:59,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:05:59,018 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-13 04:05:59,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:05:59,021 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-13 04:05:59,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:05:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 606 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:05:59,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:05:59,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-13 04:05:59,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 04:05:59,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 04:05:59,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 04:05:59,841 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 44 states. [2018-04-13 04:06:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:03,106 INFO L93 Difference]: Finished difference Result 1294 states and 1317 transitions. [2018-04-13 04:06:03,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 04:06:03,106 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 129 [2018-04-13 04:06:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:03,107 INFO L225 Difference]: With dead ends: 1294 [2018-04-13 04:06:03,107 INFO L226 Difference]: Without dead ends: 1294 [2018-04-13 04:06:03,107 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=314, Invalid=6996, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 04:06:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2018-04-13 04:06:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 258. [2018-04-13 04:06:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:06:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:06:03,110 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:06:03,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:03,110 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:06:03,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 04:06:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:06:03,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:06:03,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:03,110 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:03,110 INFO L408 AbstractCegarLoop]: === Iteration 290 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:03,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2073780481, now seen corresponding path program 203 times [2018-04-13 04:06:03,110 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:03,110 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:03,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:03,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:06:03,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:03,124 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:03,127 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:06:03,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:03,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:03,127 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:06:03,315 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-04-13 04:06:03,315 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:06:03,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:03,333 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-13 04:06:03,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:03,336 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-13 04:06:03,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:03,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:03,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:06:03,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:03,347 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-13 04:06:03,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:03,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:03,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:03,356 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-13 04:06:03,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:03,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:03,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2018-04-13 04:06:03,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 04:06:03,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:03,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:03,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-13 04:06:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 0 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:04,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:06:04,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 04:06:04,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 04:06:04,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 04:06:04,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1975, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 04:06:04,148 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 46 states. [2018-04-13 04:06:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:07,347 INFO L93 Difference]: Finished difference Result 1339 states and 1362 transitions. [2018-04-13 04:06:07,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 04:06:07,347 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 129 [2018-04-13 04:06:07,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:07,348 INFO L225 Difference]: With dead ends: 1339 [2018-04-13 04:06:07,348 INFO L226 Difference]: Without dead ends: 1339 [2018-04-13 04:06:07,348 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=328, Invalid=7504, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 04:06:07,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-04-13 04:06:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 258. [2018-04-13 04:06:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 04:06:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-04-13 04:06:07,351 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 129 [2018-04-13 04:06:07,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:07,351 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-04-13 04:06:07,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 04:06:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-04-13 04:06:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:06:07,351 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:07,351 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:07,351 INFO L408 AbstractCegarLoop]: === Iteration 291 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:07,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1411229110, now seen corresponding path program 204 times [2018-04-13 04:06:07,351 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:07,352 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:07,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:06:07,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:07,365 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:07,369 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:06:07,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:07,369 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:07,370 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:06:07,474 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-04-13 04:06:07,475 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:06:07,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:07,485 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-13 04:06:07,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,489 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-13 04:06:07,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:06:07,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:07,500 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-13 04:06:07,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:07,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:07,507 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-13 04:06:07,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,510 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-13 04:06:07,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:06:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:08,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:06:08,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 04:06:08,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 04:06:08,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 04:06:08,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 04:06:08,171 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 41 states. Received shutdown request... [2018-04-13 04:06:08,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 04:06:08,605 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 04:06:08,608 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 04:06:08,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 04:06:08 BoogieIcfgContainer [2018-04-13 04:06:08,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 04:06:08,609 INFO L168 Benchmark]: Toolchain (without parser) took 766233.72 ms. Allocated memory was 402.7 MB in the beginning and 2.9 GB in the end (delta: 2.5 GB). Free memory was 339.9 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-04-13 04:06:08,610 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 402.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 04:06:08,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.49 ms. Allocated memory is still 402.7 MB. Free memory was 339.9 MB in the beginning and 314.8 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-13 04:06:08,611 INFO L168 Benchmark]: Boogie Preprocessor took 40.93 ms. Allocated memory is still 402.7 MB. Free memory was 314.8 MB in the beginning and 313.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 04:06:08,611 INFO L168 Benchmark]: RCFGBuilder took 345.95 ms. Allocated memory was 402.7 MB in the beginning and 612.9 MB in the end (delta: 210.2 MB). Free memory was 312.2 MB in the beginning and 548.9 MB in the end (delta: -236.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-04-13 04:06:08,611 INFO L168 Benchmark]: TraceAbstraction took 765600.80 ms. Allocated memory was 612.9 MB in the beginning and 2.9 GB in the end (delta: 2.3 GB). Free memory was 548.9 MB in the beginning and 1.4 GB in the end (delta: -855.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-04-13 04:06:08,613 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.16 ms. Allocated memory is still 402.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 243.49 ms. Allocated memory is still 402.7 MB. Free memory was 339.9 MB in the beginning and 314.8 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.93 ms. Allocated memory is still 402.7 MB. Free memory was 314.8 MB in the beginning and 313.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 345.95 ms. Allocated memory was 402.7 MB in the beginning and 612.9 MB in the end (delta: 210.2 MB). Free memory was 312.2 MB in the beginning and 548.9 MB in the end (delta: -236.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 765600.80 ms. Allocated memory was 612.9 MB in the beginning and 2.9 GB in the end (delta: 2.3 GB). Free memory was 548.9 MB in the beginning and 1.4 GB in the end (delta: -855.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (258states) and interpolant automaton (currently 9 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (60 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (258states) and interpolant automaton (currently 9 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (60 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (258states) and interpolant automaton (currently 9 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (60 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (258states) and interpolant automaton (currently 9 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (60 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (258states) and interpolant automaton (currently 9 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (60 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (258states) and interpolant automaton (currently 9 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (60 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (258states) and interpolant automaton (currently 9 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (60 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 558]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (258states) and interpolant automaton (currently 9 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (60 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (258states) and interpolant automaton (currently 9 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (60 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 52 locations, 9 error locations. TIMEOUT Result, 765.5s OverallTime, 291 OverallIterations, 22 TraceHistogramMax, 485.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20063 SDtfs, 50713 SDslu, 504605 SDs, 0 SdLazy, 713717 SolverSat, 9171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 224.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33106 GetRequests, 16369 SyntacticMatches, 22 SemanticMatches, 16715 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 137346 ImplicationChecksByTransitivity, 372.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=277, 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.5s AutomataMinimizationTime, 290 MinimizatonAttempts, 115953 StatesRemovedByMinimization, 284 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 14.4s SatisfiabilityAnalysisTime, 263.3s InterpolantComputationTime, 50646 NumberOfCodeBlocks, 50602 NumberOfCodeBlocksAsserted, 2071 NumberOfCheckSat, 25145 ConstructedInterpolants, 2361 QuantifiedInterpolants, 44252273 SizeOfPredicates, 12722 NumberOfNonLiveVariables, 137653 ConjunctsInSsa, 52017 ConjunctsInUnsatCore, 292 InterpolantComputations, 14 PerfectInterpolantSequences, 10/109806 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_04-06-08-619.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_04-06-08-619.csv Completed graceful shutdown