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/cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 03:53:06,978 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 03:53:06,980 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 03:53:06,999 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 03:53:06,999 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 03:53:07,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 03:53:07,001 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 03:53:07,002 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 03:53:07,004 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 03:53:07,005 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 03:53:07,006 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 03:53:07,006 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 03:53:07,007 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 03:53:07,008 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 03:53:07,009 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 03:53:07,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 03:53:07,012 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 03:53:07,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 03:53:07,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 03:53:07,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 03:53:07,018 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 03:53:07,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 03:53:07,018 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 03:53:07,019 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 03:53:07,020 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 03:53:07,021 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 03:53:07,021 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 03:53:07,021 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 03:53:07,022 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 03:53:07,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 03:53:07,023 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 03:53:07,023 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:07,033 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 03:53:07,033 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 03:53:07,034 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 03:53:07,035 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 03:53:07,035 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 03:53:07,035 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 03:53:07,035 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 03:53:07,035 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 03:53:07,035 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 03:53:07,035 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 03:53:07,036 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 03:53:07,036 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 03:53:07,036 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 03:53:07,036 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 03:53:07,036 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 03:53:07,036 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 03:53:07,036 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 03:53:07,036 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 03:53:07,036 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 03:53:07,036 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 03:53:07,037 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 03:53:07,037 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 03:53:07,037 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 03:53:07,037 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:07,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 03:53:07,071 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 03:53:07,073 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 03:53:07,074 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 03:53:07,075 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 03:53:07,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,361 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9ef9b2e6e [2018-04-13 03:53:07,495 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 03:53:07,495 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 03:53:07,496 INFO L168 CDTParser]: Scanning cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,502 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 03:53:07,503 INFO L215 ultiparseSymbolTable]: [2018-04-13 03:53:07,503 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 03:53:07,503 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,503 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,503 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,503 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,503 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 03:53:07,503 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,503 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_char in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____id_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_long in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ulong in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__key_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_long in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_short in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____off_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,506 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,506 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,506 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__size_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,506 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,506 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,506 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,506 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,506 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,506 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,506 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,506 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,506 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,507 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,507 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,507 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,507 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,507 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,507 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,507 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,507 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__off_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,507 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,507 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__div_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,508 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_char in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,508 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,508 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,508 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,508 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,508 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,508 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,508 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,508 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,508 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,508 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,509 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,509 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,509 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,509 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,509 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,509 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,509 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,509 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,509 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,509 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__id_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,509 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,509 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,510 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_short in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,510 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,510 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,510 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,510 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,510 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,510 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__uint in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,510 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,510 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,510 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,510 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ushort in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____time_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,511 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,512 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,512 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____key_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,512 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,512 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,512 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,512 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,512 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,512 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_int in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,512 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__time_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,512 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,512 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,512 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,512 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,513 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,513 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__register_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,513 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,513 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:07,545 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9ef9b2e6e [2018-04-13 03:53:07,549 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 03:53:07,550 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 03:53:07,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 03:53:07,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 03:53:07,554 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 03:53:07,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:53:07" (1/1) ... [2018-04-13 03:53:07,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1235e4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:07, skipping insertion in model container [2018-04-13 03:53:07,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:53:07" (1/1) ... [2018-04-13 03:53:07,567 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:53:07,590 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:53:07,732 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:53:07,770 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:53:07,775 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-13 03:53:07,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:07 WrapperNode [2018-04-13 03:53:07,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 03:53:07,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 03:53:07,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 03:53:07,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 03:53:07,835 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:07" (1/1) ... [2018-04-13 03:53:07,835 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:07" (1/1) ... [2018-04-13 03:53:07,847 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:07" (1/1) ... [2018-04-13 03:53:07,848 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:07" (1/1) ... [2018-04-13 03:53:07,856 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:07" (1/1) ... [2018-04-13 03:53:07,861 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:07" (1/1) ... [2018-04-13 03:53:07,863 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:07" (1/1) ... [2018-04-13 03:53:07,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 03:53:07,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 03:53:07,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 03:53:07,868 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 03:53:07,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:07" (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:07,957 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 03:53:07,957 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 03:53:07,957 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 03:53:07,958 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 03:53:07,958 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-04-13 03:53:07,958 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 03:53:07,958 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 03:53:07,958 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 03:53:07,958 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 03:53:07,958 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 03:53:07,958 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 03:53:07,958 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 03:53:07,958 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 03:53:07,958 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 03:53:07,958 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 03:53:07,958 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 03:53:07,958 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 03:53:07,958 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 03:53:07,959 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 03:53:07,960 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 03:53:07,961 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 03:53:07,962 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 03:53:07,963 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 03:53:07,964 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 03:53:07,964 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-04-13 03:53:07,964 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 03:53:07,964 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 03:53:07,964 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 03:53:07,964 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 03:53:07,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 03:53:07,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 03:53:07,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 03:53:07,964 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 03:53:08,239 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 03:53:08,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:53:08 BoogieIcfgContainer [2018-04-13 03:53:08,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 03:53:08,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 03:53:08,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 03:53:08,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 03:53:08,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 03:53:07" (1/3) ... [2018-04-13 03:53:08,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c980da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:53:08, skipping insertion in model container [2018-04-13 03:53:08,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:07" (2/3) ... [2018-04-13 03:53:08,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c980da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:53:08, skipping insertion in model container [2018-04-13 03:53:08,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:53:08" (3/3) ... [2018-04-13 03:53:08,245 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:08,253 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 03:53:08,259 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-13 03:53:08,294 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 03:53:08,294 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 03:53:08,294 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 03:53:08,294 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 03:53:08,294 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 03:53:08,295 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 03:53:08,295 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 03:53:08,295 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 03:53:08,295 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 03:53:08,295 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 03:53:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-04-13 03:53:08,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-13 03:53:08,309 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:08,310 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:08,310 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:08,313 INFO L82 PathProgramCache]: Analyzing trace with hash 281371018, now seen corresponding path program 1 times [2018-04-13 03:53:08,315 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:08,316 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:08,358 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:08,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:08,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:08,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:53:08,432 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:08,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:08,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 03:53:08,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 03:53:08,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 03:53:08,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 03:53:08,445 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2018-04-13 03:53:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:08,531 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-04-13 03:53:08,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 03:53:08,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-13 03:53:08,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:08,538 INFO L225 Difference]: With dead ends: 59 [2018-04-13 03:53:08,539 INFO L226 Difference]: Without dead ends: 55 [2018-04-13 03:53:08,540 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 03:53:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-13 03:53:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-13 03:53:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 03:53:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-04-13 03:53:08,572 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2018-04-13 03:53:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:08,572 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-04-13 03:53:08,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 03:53:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-04-13 03:53:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 03:53:08,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:08,573 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:08,573 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:08,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2051881253, now seen corresponding path program 1 times [2018-04-13 03:53:08,573 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:08,573 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:08,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:08,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:08,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:08,583 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:08,607 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:08,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:08,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:53:08,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:53:08,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:53:08,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:53:08,610 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-04-13 03:53:08,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:08,668 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-04-13 03:53:08,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:53:08,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-13 03:53:08,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:08,669 INFO L225 Difference]: With dead ends: 58 [2018-04-13 03:53:08,670 INFO L226 Difference]: Without dead ends: 55 [2018-04-13 03:53:08,670 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:53:08,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-13 03:53:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-13 03:53:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 03:53:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-04-13 03:53:08,673 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 15 [2018-04-13 03:53:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:08,673 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-04-13 03:53:08,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:53:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-04-13 03:53:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 03:53:08,674 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:08,674 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:08,674 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:08,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1371822883, now seen corresponding path program 1 times [2018-04-13 03:53:08,674 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:08,674 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:08,675 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:08,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:08,675 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:08,692 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:08,700 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:08,700 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:08,700 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:08,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:08,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:08,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:08,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:08,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:08,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 03:53:08,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:08,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:08,778 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:08,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:08,783 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:08,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-13 03:53:08,799 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:08,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:08,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:53:08,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:53:08,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:53:08,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:53:08,800 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states. [2018-04-13 03:53:08,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:08,852 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-04-13 03:53:08,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:53:08,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-13 03:53:08,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:08,853 INFO L225 Difference]: With dead ends: 54 [2018-04-13 03:53:08,853 INFO L226 Difference]: Without dead ends: 54 [2018-04-13 03:53:08,853 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:53:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-13 03:53:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-13 03:53:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-13 03:53:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-13 03:53:08,859 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 15 [2018-04-13 03:53:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:08,859 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-13 03:53:08,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:53:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-13 03:53:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 03:53:08,860 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:08,860 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:08,860 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:08,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1371822882, now seen corresponding path program 1 times [2018-04-13 03:53:08,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:08,860 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:08,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:08,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:08,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:08,872 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:08,875 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:08,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:08,875 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:08,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:08,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:08,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:08,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:08,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:08,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:08,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:08,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-13 03:53:08,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:08,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:08,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-13 03:53:08,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:09,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:09,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:09,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:53:09,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:09,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:53:09,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:24 [2018-04-13 03:53:09,035 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:09,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:09,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 03:53:09,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:53:09,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:53:09,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:53:09,036 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 8 states. [2018-04-13 03:53:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:09,159 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-04-13 03:53:09,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:53:09,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-04-13 03:53:09,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:09,160 INFO L225 Difference]: With dead ends: 53 [2018-04-13 03:53:09,160 INFO L226 Difference]: Without dead ends: 53 [2018-04-13 03:53:09,161 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-04-13 03:53:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-13 03:53:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-04-13 03:53:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-13 03:53:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-04-13 03:53:09,163 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 15 [2018-04-13 03:53:09,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:09,164 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-04-13 03:53:09,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:53:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-04-13 03:53:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 03:53:09,164 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:09,164 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:09,164 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:09,164 INFO L82 PathProgramCache]: Analyzing trace with hash 423163648, now seen corresponding path program 1 times [2018-04-13 03:53:09,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:09,165 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:09,165 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:09,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:09,165 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:09,173 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:09,187 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:09,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:09,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:53:09,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 03:53:09,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 03:53:09,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 03:53:09,189 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-04-13 03:53:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:09,240 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-04-13 03:53:09,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 03:53:09,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-13 03:53:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:09,240 INFO L225 Difference]: With dead ends: 52 [2018-04-13 03:53:09,241 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 03:53:09,241 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:09,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 03:53:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-13 03:53:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 03:53:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-13 03:53:09,244 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 16 [2018-04-13 03:53:09,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:09,245 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-13 03:53:09,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 03:53:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-13 03:53:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 03:53:09,245 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:09,245 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:09,245 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash 423163649, now seen corresponding path program 1 times [2018-04-13 03:53:09,246 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:09,246 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:09,247 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:09,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:09,247 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:09,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:53:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:09,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:09,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:53:09,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:53:09,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:53:09,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:53:09,285 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-04-13 03:53:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:09,306 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-04-13 03:53:09,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:53:09,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-13 03:53:09,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:09,307 INFO L225 Difference]: With dead ends: 51 [2018-04-13 03:53:09,307 INFO L226 Difference]: Without dead ends: 51 [2018-04-13 03:53:09,308 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:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-13 03:53:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-13 03:53:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 03:53:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-13 03:53:09,310 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 16 [2018-04-13 03:53:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:09,310 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-13 03:53:09,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:53:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-13 03:53:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 03:53:09,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:09,311 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] [2018-04-13 03:53:09,311 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:09,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1443369787, now seen corresponding path program 1 times [2018-04-13 03:53:09,311 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:09,311 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:09,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:09,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:09,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:09,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:53:09,337 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:09,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:09,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:53:09,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:53:09,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:53:09,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:53:09,338 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-04-13 03:53:09,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:09,379 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-04-13 03:53:09,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:53:09,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-04-13 03:53:09,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:09,380 INFO L225 Difference]: With dead ends: 47 [2018-04-13 03:53:09,380 INFO L226 Difference]: Without dead ends: 47 [2018-04-13 03:53:09,380 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:53:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-13 03:53:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-13 03:53:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-13 03:53:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-13 03:53:09,382 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 20 [2018-04-13 03:53:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:09,382 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-13 03:53:09,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:53:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-13 03:53:09,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 03:53:09,382 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:09,382 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] [2018-04-13 03:53:09,383 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:09,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1443369788, now seen corresponding path program 1 times [2018-04-13 03:53:09,383 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:09,383 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:09,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:09,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:09,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:09,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:53:09,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:09,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:09,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 03:53:09,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 03:53:09,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 03:53:09,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-13 03:53:09,465 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-04-13 03:53:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:09,628 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-04-13 03:53:09,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 03:53:09,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-04-13 03:53:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:09,631 INFO L225 Difference]: With dead ends: 65 [2018-04-13 03:53:09,631 INFO L226 Difference]: Without dead ends: 65 [2018-04-13 03:53:09,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-04-13 03:53:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-13 03:53:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-04-13 03:53:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-13 03:53:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-04-13 03:53:09,635 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 20 [2018-04-13 03:53:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:09,635 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-04-13 03:53:09,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 03:53:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-04-13 03:53:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 03:53:09,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:09,635 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] [2018-04-13 03:53:09,635 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:09,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1783256229, now seen corresponding path program 1 times [2018-04-13 03:53:09,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:09,635 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:09,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:09,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:09,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:09,644 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:09,647 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:09,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:09,647 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:09,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:09,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:09,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:09,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:09,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:09,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 03:53:09,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:09,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:09,712 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:09,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:09,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:09,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-13 03:53:09,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:53:09,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:53:09,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:09,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:09,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:53:09,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-13 03:53:09,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-13 03:53:09,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 11 treesize of output 10 [2018-04-13 03:53:09,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:09,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:09,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-13 03:53:09,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:42 [2018-04-13 03:53:09,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-04-13 03:53:09,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-13 03:53:09,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:09,837 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 13 treesize of output 10 [2018-04-13 03:53:09,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:09,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:09,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:09,850 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:47, output treesize:46 [2018-04-13 03:53:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:09,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:09,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 03:53:09,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 03:53:09,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 03:53:09,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-04-13 03:53:09,900 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 13 states. [2018-04-13 03:53:14,120 WARN L148 SmtUtils]: Spent 4016ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-13 03:53:21,428 WARN L151 SmtUtils]: Spent 7289ms on a formula simplification. DAG size of input: 57 DAG size of output 56 [2018-04-13 03:53:21,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:21,958 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2018-04-13 03:53:21,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 03:53:21,958 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-04-13 03:53:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:21,959 INFO L225 Difference]: With dead ends: 146 [2018-04-13 03:53:21,960 INFO L226 Difference]: Without dead ends: 146 [2018-04-13 03:53:21,960 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:53:21,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-13 03:53:21,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 102. [2018-04-13 03:53:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-13 03:53:21,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 130 transitions. [2018-04-13 03:53:21,971 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 130 transitions. Word has length 23 [2018-04-13 03:53:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:21,971 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 130 transitions. [2018-04-13 03:53:21,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 03:53:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions. [2018-04-13 03:53:21,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 03:53:21,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:21,972 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] [2018-04-13 03:53:21,972 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:21,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1231847389, now seen corresponding path program 1 times [2018-04-13 03:53:21,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:21,972 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:21,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:21,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:21,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:21,982 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:21,985 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:21,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:21,986 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:21,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:22,015 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:22,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 03:53:22,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:22,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:22,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 03:53:22,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:22,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:22,033 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:22,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:22,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:22,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-13 03:53:22,053 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 17 treesize of output 14 [2018-04-13 03:53:22,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 03:53:22,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:22,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:22,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 03:53:22,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2018-04-13 03:53:22,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 28 treesize of output 29 [2018-04-13 03:53:22,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 11 treesize of output 10 [2018-04-13 03:53:22,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:22,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:22,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-13 03:53:22,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:51, output treesize:47 [2018-04-13 03:53:22,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-04-13 03:53:22,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-13 03:53:22,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:22,192 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:22,193 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:22,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:22,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:22,207 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:60, output treesize:58 [2018-04-13 03:53:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:22,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:22,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 03:53:22,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 03:53:22,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 03:53:22,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-04-13 03:53:22,256 INFO L87 Difference]: Start difference. First operand 102 states and 130 transitions. Second operand 12 states. [2018-04-13 03:53:28,414 WARN L148 SmtUtils]: Spent 4012ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-13 03:53:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:30,874 INFO L93 Difference]: Finished difference Result 168 states and 209 transitions. [2018-04-13 03:53:30,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 03:53:30,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-04-13 03:53:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:30,875 INFO L225 Difference]: With dead ends: 168 [2018-04-13 03:53:30,875 INFO L226 Difference]: Without dead ends: 168 [2018-04-13 03:53:30,875 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:53:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-13 03:53:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 63. [2018-04-13 03:53:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-13 03:53:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2018-04-13 03:53:30,879 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 23 [2018-04-13 03:53:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:30,879 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2018-04-13 03:53:30,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 03:53:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-04-13 03:53:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 03:53:30,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:30,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, 1] [2018-04-13 03:53:30,880 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:30,880 INFO L82 PathProgramCache]: Analyzing trace with hash -18671751, now seen corresponding path program 1 times [2018-04-13 03:53:30,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:30,880 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:30,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:30,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:30,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:30,889 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,923 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:30,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:30,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:53:30,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:53:30,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:53:30,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:53:30,924 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 6 states. [2018-04-13 03:53:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:30,977 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-04-13 03:53:30,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:53:30,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-13 03:53:30,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:30,978 INFO L225 Difference]: With dead ends: 64 [2018-04-13 03:53:30,978 INFO L226 Difference]: Without dead ends: 64 [2018-04-13 03:53:30,979 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:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-13 03:53:30,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-04-13 03:53:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-13 03:53:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-04-13 03:53:30,981 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 25 [2018-04-13 03:53:30,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:30,981 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-04-13 03:53:30,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:53:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-04-13 03:53:30,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 03:53:30,982 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:30,982 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:30,982 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:30,982 INFO L82 PathProgramCache]: Analyzing trace with hash -18671750, now seen corresponding path program 1 times [2018-04-13 03:53:30,982 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:30,982 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:30,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:30,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:30,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:30,990 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,039 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:31,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:31,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 03:53:31,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 03:53:31,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 03:53:31,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-13 03:53:31,040 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 9 states. [2018-04-13 03:53:31,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:31,137 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2018-04-13 03:53:31,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:53:31,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-04-13 03:53:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:31,158 INFO L225 Difference]: With dead ends: 83 [2018-04-13 03:53:31,158 INFO L226 Difference]: Without dead ends: 83 [2018-04-13 03:53:31,158 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:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-13 03:53:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2018-04-13 03:53:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-13 03:53:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-04-13 03:53:31,161 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 25 [2018-04-13 03:53:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:31,161 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-04-13 03:53:31,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 03:53:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-04-13 03:53:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 03:53:31,162 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:31,162 INFO L355 BasicCegarLoop]: trace histogram [3, 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:31,162 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:31,162 INFO L82 PathProgramCache]: Analyzing trace with hash -535876900, now seen corresponding path program 2 times [2018-04-13 03:53:31,163 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:31,163 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:31,163 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:31,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:31,163 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:31,171 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,175 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:31,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:31,175 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:31,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:53:31,201 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:53:31,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:31,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:31,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,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:31,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,227 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,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:53:31,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:31,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out 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,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:31,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:31,264 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,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,270 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,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 03:53:31,290 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 19 treesize of output 16 [2018-04-13 03:53:31,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 03:53:31,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:53:31,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-13 03:53:31,316 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 32 treesize of output 33 [2018-04-13 03:53:31,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 13 treesize of output 12 [2018-04-13 03:53:31,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 03:53:31,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-13 03:53:31,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-04-13 03:53:31,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 03:53:31,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:31,429 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 19 treesize of output 16 [2018-04-13 03:53:31,430 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:31,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:31,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:31,448 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:35 [2018-04-13 03:53:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:31,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:31,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 03:53:31,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 03:53:31,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 03:53:31,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-04-13 03:53:31,567 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 15 states. [2018-04-13 03:53:35,815 WARN L148 SmtUtils]: Spent 4015ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-13 03:53:37,314 WARN L151 SmtUtils]: Spent 1483ms on a formula simplification. DAG size of input: 63 DAG size of output 56 [2018-04-13 03:53:41,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:41,575 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2018-04-13 03:53:41,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 03:53:41,576 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-04-13 03:53:41,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:41,577 INFO L225 Difference]: With dead ends: 110 [2018-04-13 03:53:41,577 INFO L226 Difference]: Without dead ends: 110 [2018-04-13 03:53:41,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:53:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-04-13 03:53:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 83. [2018-04-13 03:53:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-13 03:53:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-04-13 03:53:41,584 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 26 [2018-04-13 03:53:41,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:41,584 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-04-13 03:53:41,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 03:53:41,584 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2018-04-13 03:53:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 03:53:41,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:41,585 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 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,585 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash 84668347, now seen corresponding path program 3 times [2018-04-13 03:53:41,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:41,585 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:41,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:41,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:41,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:41,596 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,600 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:41,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:41,600 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:41,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:53:41,627 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 03:53:41,627 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:41,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:41,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 03:53:41,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,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:53:41,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,658 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,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:53:41,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:41,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:41,680 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,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out 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,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,700 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,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 03:53:41,724 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:41,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:41,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-13 03:53:41,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 03:53:41,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:41,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 03:53:41,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-04-13 03:53:41,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-04-13 03:53:41,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 03:53:41,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:41,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, 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:41,828 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:41,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:41,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:41,837 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-04-13 03:53:41,904 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:41,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:41,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 03:53:41,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 03:53:41,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 03:53:41,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:53:41,905 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 16 states. [2018-04-13 03:53:42,321 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 49 DAG size of output 45 [2018-04-13 03:53:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:44,073 INFO L93 Difference]: Finished difference Result 232 states and 280 transitions. [2018-04-13 03:53:44,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 03:53:44,074 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-04-13 03:53:44,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:44,075 INFO L225 Difference]: With dead ends: 232 [2018-04-13 03:53:44,075 INFO L226 Difference]: Without dead ends: 232 [2018-04-13 03:53:44,075 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:53:44,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-13 03:53:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 156. [2018-04-13 03:53:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-13 03:53:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 202 transitions. [2018-04-13 03:53:44,081 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 202 transitions. Word has length 29 [2018-04-13 03:53:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:44,081 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 202 transitions. [2018-04-13 03:53:44,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 03:53:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 202 transitions. [2018-04-13 03:53:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 03:53:44,082 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:44,082 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:44,082 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:53:44,082 INFO L82 PathProgramCache]: Analyzing trace with hash 507370173, now seen corresponding path program 2 times [2018-04-13 03:53:44,082 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:44,082 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:44,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:44,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:44,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:44,092 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,098 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:44,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:44,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:44,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:53:44,120 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:53:44,120 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:44,123 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:44,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:44,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,161 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,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:53:44,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:44,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out 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,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:44,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:44,210 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,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,217 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,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 03:53:44,237 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 19 treesize of output 16 [2018-04-13 03:53:44,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 16 treesize of output 15 [2018-04-13 03:53:44,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,239 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,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:53:44,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-13 03:53:44,259 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 32 treesize of output 33 [2018-04-13 03:53:44,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:44,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,264 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,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 03:53:44,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-13 03:53:44,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-04-13 03:53:44,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 03:53:44,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:44,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:44,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2018-04-13 03:53:44,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:44,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:44,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:44,437 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:72, output treesize:49 [2018-04-13 03:53:44,528 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:44,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:44,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 03:53:44,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:53:44,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:53:44,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:53:44,529 INFO L87 Difference]: Start difference. First operand 156 states and 202 transitions. Second operand 17 states. [2018-04-13 03:53:48,748 WARN L148 SmtUtils]: Spent 4028ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-13 03:53:52,781 WARN L148 SmtUtils]: Spent 4015ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-13 03:53:53,841 WARN L151 SmtUtils]: Spent 1010ms on a formula simplification. DAG size of input: 57 DAG size of output 53 [2018-04-13 03:53:56,014 WARN L151 SmtUtils]: Spent 2136ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-04-13 03:54:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:04,989 INFO L93 Difference]: Finished difference Result 276 states and 351 transitions. [2018-04-13 03:54:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 03:54:04,989 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-04-13 03:54:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:04,990 INFO L225 Difference]: With dead ends: 276 [2018-04-13 03:54:04,990 INFO L226 Difference]: Without dead ends: 276 [2018-04-13 03:54:04,990 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:54:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-13 03:54:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 196. [2018-04-13 03:54:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-13 03:54:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 259 transitions. [2018-04-13 03:54:04,997 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 259 transitions. Word has length 29 [2018-04-13 03:54:04,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:04,997 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 259 transitions. [2018-04-13 03:54:04,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:54:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 259 transitions. [2018-04-13 03:54:04,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 03:54:04,997 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:04,997 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:04,997 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:04,998 INFO L82 PathProgramCache]: Analyzing trace with hash -443531092, now seen corresponding path program 1 times [2018-04-13 03:54:04,998 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:04,998 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:04,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:04,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:04,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:05,004 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,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:05,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:54:05,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:54:05,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 03:54:05,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 03:54:05,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 03:54:05,018 INFO L87 Difference]: Start difference. First operand 196 states and 259 transitions. Second operand 3 states. [2018-04-13 03:54:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:05,024 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2018-04-13 03:54:05,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 03:54:05,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-04-13 03:54:05,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:05,025 INFO L225 Difference]: With dead ends: 181 [2018-04-13 03:54:05,025 INFO L226 Difference]: Without dead ends: 181 [2018-04-13 03:54:05,025 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 03:54:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-04-13 03:54:05,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 85. [2018-04-13 03:54:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-13 03:54:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2018-04-13 03:54:05,028 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 30 [2018-04-13 03:54:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:05,028 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2018-04-13 03:54:05,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 03:54:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2018-04-13 03:54:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 03:54:05,029 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:05,029 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:05,030 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1208879740, now seen corresponding path program 4 times [2018-04-13 03:54:05,030 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:05,030 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:05,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:05,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:05,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:05,039 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,047 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:05,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:05,048 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:05,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:54:05,079 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:54:05,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:05,082 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:05,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:54:05,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:05,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:54:05,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:05,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:05,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:54:05,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:05,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out 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,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:05,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:05,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:05,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:54:05,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:05,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:05,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 03:54:05,159 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:54:05,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 12 treesize of output 11 [2018-04-13 03:54:05,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:05,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:05,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:05,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-13 03:54:05,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-13 03:54:05,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:54:05,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:05,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:05,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:05,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-13 03:54:05,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-04-13 03:54:05,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 03:54:05,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:05,276 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:54:05,276 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:54:05,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:54:05,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:54:05,282 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-04-13 03:54:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:05,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:05,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 03:54:05,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 03:54:05,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 03:54:05,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-04-13 03:54:05,335 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand 18 states. [2018-04-13 03:54:05,715 WARN L151 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 33 DAG size of output 29 [2018-04-13 03:54:05,857 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 35 DAG size of output 31 [2018-04-13 03:54:07,770 WARN L151 SmtUtils]: Spent 1873ms on a formula simplification. DAG size of input: 36 DAG size of output 32 [2018-04-13 03:54:08,150 WARN L151 SmtUtils]: Spent 295ms on a formula simplification. DAG size of input: 44 DAG size of output 38 [2018-04-13 03:54:09,885 WARN L151 SmtUtils]: Spent 1446ms on a formula simplification. DAG size of input: 43 DAG size of output 37 [2018-04-13 03:54:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:10,249 INFO L93 Difference]: Finished difference Result 214 states and 252 transitions. [2018-04-13 03:54:10,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 03:54:10,250 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-04-13 03:54:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:10,251 INFO L225 Difference]: With dead ends: 214 [2018-04-13 03:54:10,251 INFO L226 Difference]: Without dead ends: 214 [2018-04-13 03:54:10,251 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=240, Invalid=1092, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 03:54:10,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-13 03:54:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 133. [2018-04-13 03:54:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-13 03:54:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2018-04-13 03:54:10,256 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 32 [2018-04-13 03:54:10,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:10,256 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2018-04-13 03:54:10,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 03:54:10,256 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2018-04-13 03:54:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 03:54:10,257 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:10,257 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:10,257 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:10,257 INFO L82 PathProgramCache]: Analyzing trace with hash -751050763, now seen corresponding path program 1 times [2018-04-13 03:54:10,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:10,258 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:10,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:10,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:10,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:10,266 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,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:10,324 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:10,324 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:10,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:10,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:10,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:54:10,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-04-13 03:54:10,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 03:54:10,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 03:54:10,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:54:10,352 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand 7 states. [2018-04-13 03:54:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:10,409 INFO L93 Difference]: Finished difference Result 176 states and 207 transitions. [2018-04-13 03:54:10,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:54:10,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-04-13 03:54:10,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:10,410 INFO L225 Difference]: With dead ends: 176 [2018-04-13 03:54:10,411 INFO L226 Difference]: Without dead ends: 176 [2018-04-13 03:54:10,411 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-13 03:54:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-13 03:54:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 131. [2018-04-13 03:54:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-13 03:54:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 158 transitions. [2018-04-13 03:54:10,414 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 158 transitions. Word has length 32 [2018-04-13 03:54:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:10,415 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 158 transitions. [2018-04-13 03:54:10,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 03:54:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 158 transitions. [2018-04-13 03:54:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 03:54:10,415 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:10,415 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:10,415 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1074866234, now seen corresponding path program 3 times [2018-04-13 03:54:10,416 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:10,416 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:10,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:10,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:10,417 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:10,425 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,431 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:10,431 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:10,431 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:10,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:54:10,457 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-13 03:54:10,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:10,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:10,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,482 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,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:54:10,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:10,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out 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,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:10,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:10,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:10,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,526 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,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 03:54:10,551 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 19 treesize of output 16 [2018-04-13 03:54:10,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 03:54:10,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:10,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-13 03:54:10,584 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 32 treesize of output 33 [2018-04-13 03:54:10,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 03:54:10,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:10,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-13 03:54:10,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-04-13 03:54:10,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 03:54:10,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:10,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 62 [2018-04-13 03:54:10,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 5 xjuncts. [2018-04-13 03:54:10,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:54:10,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:54:10,857 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:88 [2018-04-13 03:54:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:10,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:10,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:54:10,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:54:10,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:54:10,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:54:10,977 INFO L87 Difference]: Start difference. First operand 131 states and 158 transitions. Second operand 19 states. [2018-04-13 03:54:11,402 WARN L151 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 50 DAG size of output 46 [2018-04-13 03:54:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:15,802 INFO L93 Difference]: Finished difference Result 281 states and 340 transitions. [2018-04-13 03:54:15,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 03:54:15,803 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-04-13 03:54:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:15,804 INFO L225 Difference]: With dead ends: 281 [2018-04-13 03:54:15,804 INFO L226 Difference]: Without dead ends: 281 [2018-04-13 03:54:15,804 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2018-04-13 03:54:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-13 03:54:15,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 134. [2018-04-13 03:54:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-13 03:54:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2018-04-13 03:54:15,809 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 32 [2018-04-13 03:54:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:15,809 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2018-04-13 03:54:15,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:54:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2018-04-13 03:54:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 03:54:15,810 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:15,810 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:15,810 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:15,810 INFO L82 PathProgramCache]: Analyzing trace with hash -885064269, now seen corresponding path program 1 times [2018-04-13 03:54:15,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:15,810 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:15,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:15,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:15,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:15,824 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,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:15,890 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:54:15,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-13 03:54:15,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 03:54:15,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 03:54:15,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-13 03:54:15,890 INFO L87 Difference]: Start difference. First operand 134 states and 162 transitions. Second operand 11 states. [2018-04-13 03:54:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:15,991 INFO L93 Difference]: Finished difference Result 258 states and 305 transitions. [2018-04-13 03:54:15,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 03:54:15,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-04-13 03:54:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:15,992 INFO L225 Difference]: With dead ends: 258 [2018-04-13 03:54:15,992 INFO L226 Difference]: Without dead ends: 258 [2018-04-13 03:54:15,992 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:54:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-13 03:54:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 210. [2018-04-13 03:54:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-13 03:54:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 256 transitions. [2018-04-13 03:54:15,996 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 256 transitions. Word has length 32 [2018-04-13 03:54:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:15,996 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 256 transitions. [2018-04-13 03:54:15,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 03:54:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 256 transitions. [2018-04-13 03:54:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 03:54:15,997 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:15,997 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:15,997 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:15,997 INFO L82 PathProgramCache]: Analyzing trace with hash -744515659, now seen corresponding path program 1 times [2018-04-13 03:54:15,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:15,998 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:15,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:15,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:15,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:16,005 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:16,152 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:54:16,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:16,152 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:16,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:16,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:16,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:16,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:16,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:16,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 03:54:16,208 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:54:16,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:54:16,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:16,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:16,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:16,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 03:54:16,329 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:54:16,335 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:54:16,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:54:16,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:54:16,348 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:54:16,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-04-13 03:54:16,458 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:54:16,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:54:16,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-13 03:54:16,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 03:54:16,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 03:54:16,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:54:16,459 INFO L87 Difference]: Start difference. First operand 210 states and 256 transitions. Second operand 23 states. [2018-04-13 03:54:17,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:17,123 INFO L93 Difference]: Finished difference Result 288 states and 347 transitions. [2018-04-13 03:54:17,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 03:54:17,124 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-04-13 03:54:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:17,125 INFO L225 Difference]: With dead ends: 288 [2018-04-13 03:54:17,125 INFO L226 Difference]: Without dead ends: 288 [2018-04-13 03:54:17,125 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:54:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-13 03:54:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 220. [2018-04-13 03:54:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-13 03:54:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 269 transitions. [2018-04-13 03:54:17,128 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 269 transitions. Word has length 32 [2018-04-13 03:54:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:17,129 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 269 transitions. [2018-04-13 03:54:17,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 03:54:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 269 transitions. [2018-04-13 03:54:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 03:54:17,129 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:17,129 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:17,129 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:17,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1745688551, now seen corresponding path program 1 times [2018-04-13 03:54:17,129 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:17,130 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:17,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:17,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:17,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:17,135 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,136 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:17,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:17,137 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:17,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:17,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:17,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 03:54:17,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:17,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:54:17,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:17,208 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,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-13 03:54:17,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:17,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:17,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-13 03:54:17,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:17,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:17,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:17,245 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,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:17,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:17,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-13 03:54:17,386 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:54:17,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:17,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 03:54:17,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 03:54:17,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 03:54:17,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-04-13 03:54:17,387 INFO L87 Difference]: Start difference. First operand 220 states and 269 transitions. Second operand 15 states. [2018-04-13 03:54:17,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:17,631 INFO L93 Difference]: Finished difference Result 283 states and 340 transitions. [2018-04-13 03:54:17,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:54:17,631 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-04-13 03:54:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:17,632 INFO L225 Difference]: With dead ends: 283 [2018-04-13 03:54:17,632 INFO L226 Difference]: Without dead ends: 283 [2018-04-13 03:54:17,632 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:54:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-13 03:54:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 203. [2018-04-13 03:54:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-13 03:54:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 246 transitions. [2018-04-13 03:54:17,635 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 246 transitions. Word has length 33 [2018-04-13 03:54:17,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:17,635 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 246 transitions. [2018-04-13 03:54:17,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 03:54:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 246 transitions. [2018-04-13 03:54:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 03:54:17,636 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:17,636 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:17,636 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:17,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1605139941, now seen corresponding path program 1 times [2018-04-13 03:54:17,636 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:17,636 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:17,637 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:17,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:17,637 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:17,641 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,643 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:17,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:17,643 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:17,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:17,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:17,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:17,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 03:54:17,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:17,709 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,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-13 03:54:17,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:17,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:17,743 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,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:17,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:17,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-13 03:54:17,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:17,762 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:17,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:24 [2018-04-13 03:54:17,858 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:54:17,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:17,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 03:54:17,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 03:54:17,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 03:54:17,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-13 03:54:17,859 INFO L87 Difference]: Start difference. First operand 203 states and 246 transitions. Second operand 13 states. [2018-04-13 03:54:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:18,186 INFO L93 Difference]: Finished difference Result 337 states and 407 transitions. [2018-04-13 03:54:18,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 03:54:18,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-04-13 03:54:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:18,192 INFO L225 Difference]: With dead ends: 337 [2018-04-13 03:54:18,192 INFO L226 Difference]: Without dead ends: 337 [2018-04-13 03:54:18,193 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:54:18,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-13 03:54:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 203. [2018-04-13 03:54:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-13 03:54:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 246 transitions. [2018-04-13 03:54:18,198 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 246 transitions. Word has length 33 [2018-04-13 03:54:18,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:18,198 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 246 transitions. [2018-04-13 03:54:18,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 03:54:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 246 transitions. [2018-04-13 03:54:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 03:54:18,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:18,199 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:18,199 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:18,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1936224867, now seen corresponding path program 4 times [2018-04-13 03:54:18,200 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:18,200 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:18,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:18,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:18,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:18,210 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,217 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:18,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:18,217 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:18,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:54:18,244 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:54:18,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:18,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:18,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:54:18,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:18,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 03:54:18,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:18,270 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,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:54:18,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:18,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, 1 disjoint index pairs (out 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,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:18,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:18,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:18,323 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,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:18,330 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,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 03:54:18,352 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 19 treesize of output 16 [2018-04-13 03:54:18,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 03:54:18,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:18,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:18,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:18,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-13 03:54:18,375 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 32 treesize of output 33 [2018-04-13 03:54:18,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:54:18,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:18,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:18,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:18,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-13 03:54:19,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2018-04-13 03:54:19,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:19,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 117 [2018-04-13 03:54:19,574 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 03:54:19,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 36 xjuncts. [2018-04-13 03:54:19,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 03:54:19,683 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:19,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:54:19,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:54:19,734 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:98, output treesize:236 [2018-04-13 03:54:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:19,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:19,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 03:54:19,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:54:19,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:54:19,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-04-13 03:54:19,869 INFO L87 Difference]: Start difference. First operand 203 states and 246 transitions. Second operand 21 states. [2018-04-13 03:54:24,104 WARN L148 SmtUtils]: Spent 4013ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-13 03:54:29,239 WARN L151 SmtUtils]: Spent 5103ms on a formula simplification. DAG size of input: 55 DAG size of output 51 [2018-04-13 03:54:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:34,468 INFO L93 Difference]: Finished difference Result 563 states and 674 transitions. [2018-04-13 03:54:34,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 03:54:34,469 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2018-04-13 03:54:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:34,470 INFO L225 Difference]: With dead ends: 563 [2018-04-13 03:54:34,470 INFO L226 Difference]: Without dead ends: 563 [2018-04-13 03:54:34,470 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=160, Invalid=961, Unknown=1, NotChecked=0, Total=1122 [2018-04-13 03:54:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-04-13 03:54:34,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 209. [2018-04-13 03:54:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-13 03:54:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 254 transitions. [2018-04-13 03:54:34,475 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 254 transitions. Word has length 35 [2018-04-13 03:54:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:34,475 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 254 transitions. [2018-04-13 03:54:34,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:54:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 254 transitions. [2018-04-13 03:54:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 03:54:34,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:34,475 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:34,475 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:34,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1826876010, now seen corresponding path program 1 times [2018-04-13 03:54:34,476 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:34,476 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:34,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:34,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:34,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:34,479 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,496 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:54:34,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:54:34,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 03:54:34,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:54:34,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:54:34,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:54:34,496 INFO L87 Difference]: Start difference. First operand 209 states and 254 transitions. Second operand 6 states. [2018-04-13 03:54:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:34,524 INFO L93 Difference]: Finished difference Result 265 states and 316 transitions. [2018-04-13 03:54:34,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 03:54:34,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-04-13 03:54:34,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:34,525 INFO L225 Difference]: With dead ends: 265 [2018-04-13 03:54:34,525 INFO L226 Difference]: Without dead ends: 237 [2018-04-13 03:54:34,526 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:54:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-13 03:54:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 213. [2018-04-13 03:54:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-13 03:54:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 254 transitions. [2018-04-13 03:54:34,529 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 254 transitions. Word has length 36 [2018-04-13 03:54:34,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:34,530 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 254 transitions. [2018-04-13 03:54:34,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:54:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 254 transitions. [2018-04-13 03:54:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 03:54:34,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:34,530 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 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,530 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:34,530 INFO L82 PathProgramCache]: Analyzing trace with hash -664270502, now seen corresponding path program 5 times [2018-04-13 03:54:34,530 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:34,530 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:34,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:34,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:34,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:34,538 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,545 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:34,545 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:34,545 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:34,546 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:54:34,575 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-04-13 03:54:34,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:34,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:34,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:54:34,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,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:34,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,603 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,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:54:34,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:34,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out 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,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:34,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:34,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 03:54:34,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,641 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,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 03:54:34,686 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 19 treesize of output 16 [2018-04-13 03:54:34,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 03:54:34,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:34,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-13 03:54:34,724 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 32 treesize of output 33 [2018-04-13 03:54:34,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:54:34,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:34,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-13 03:54:34,910 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:54:34,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:34,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:34,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:67 [2018-04-13 03:54:35,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-04-13 03:54:35,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 03:54:35,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:35,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:35,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:35,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:35,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:35,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 92 [2018-04-13 03:54:35,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:54:35,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:54:35,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:54:35,189 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:83, output treesize:112 [2018-04-13 03:54:35,289 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:54:35,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:35,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 03:54:35,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 03:54:35,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 03:54:35,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:54:35,290 INFO L87 Difference]: Start difference. First operand 213 states and 254 transitions. Second operand 22 states. [2018-04-13 03:54:37,640 WARN L151 SmtUtils]: Spent 2040ms on a formula simplification. DAG size of input: 52 DAG size of output 48 [2018-04-13 03:54:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:46,843 INFO L93 Difference]: Finished difference Result 454 states and 525 transitions. [2018-04-13 03:54:46,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 03:54:46,844 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-04-13 03:54:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:46,845 INFO L225 Difference]: With dead ends: 454 [2018-04-13 03:54:46,845 INFO L226 Difference]: Without dead ends: 450 [2018-04-13 03:54:46,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:54:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-04-13 03:54:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 219. [2018-04-13 03:54:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-13 03:54:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 262 transitions. [2018-04-13 03:54:46,851 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 262 transitions. Word has length 38 [2018-04-13 03:54:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:46,851 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 262 transitions. [2018-04-13 03:54:46,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 03:54:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 262 transitions. [2018-04-13 03:54:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 03:54:46,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:46,852 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:46,852 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash -709485801, now seen corresponding path program 1 times [2018-04-13 03:54:46,853 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:46,853 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:46,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:46,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:46,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:46,860 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:46,862 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:46,862 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:46,862 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:46,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:46,875 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:46,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:46,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-13 03:54:46,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:46,914 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:46,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:46,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:46,922 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:54:46,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-13 03:54:46,944 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-13 03:54:46,947 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-13 03:54:46,952 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:54:46,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:54:46,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 03:54:46,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:54:46,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:54:46,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-13 03:54:46,953 INFO L87 Difference]: Start difference. First operand 219 states and 262 transitions. Second operand 8 states. [2018-04-13 03:54:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:47,036 INFO L93 Difference]: Finished difference Result 218 states and 261 transitions. [2018-04-13 03:54:47,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 03:54:47,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-04-13 03:54:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:47,036 INFO L225 Difference]: With dead ends: 218 [2018-04-13 03:54:47,036 INFO L226 Difference]: Without dead ends: 138 [2018-04-13 03:54:47,037 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 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:54:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-13 03:54:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2018-04-13 03:54:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-13 03:54:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-04-13 03:54:47,039 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 39 [2018-04-13 03:54:47,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:47,039 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-04-13 03:54:47,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:54:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-04-13 03:54:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 03:54:47,040 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:47,040 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-04-13 03:54:47,040 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:47,040 INFO L82 PathProgramCache]: Analyzing trace with hash -95111334, now seen corresponding path program 2 times [2018-04-13 03:54:47,040 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:47,040 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:47,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:47,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:47,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:47,050 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:47,055 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:47,055 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:47,055 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:47,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:54:47,079 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:54:47,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:47,082 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:47,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:47,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 03:54:47,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:47,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:47,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:47,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:54:47,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-13 03:54:47,136 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:54:47,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 13 treesize of output 12 [2018-04-13 03:54:47,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-13 03:54:47,188 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:54:47,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:54:47,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,197 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:54:47,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-04-13 03:54:47,221 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:54:47,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, 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:54:47,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:54:47,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:54:47,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:54:47,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-04-13 03:54:47,338 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:54:47,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:47,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 03:54:47,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 03:54:47,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 03:54:47,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-04-13 03:54:47,338 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 18 states. [2018-04-13 03:54:47,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:47,825 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2018-04-13 03:54:47,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 03:54:47,825 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-04-13 03:54:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:47,826 INFO L225 Difference]: With dead ends: 162 [2018-04-13 03:54:47,826 INFO L226 Difference]: Without dead ends: 162 [2018-04-13 03:54:47,826 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:54:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-13 03:54:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 137. [2018-04-13 03:54:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-13 03:54:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2018-04-13 03:54:47,828 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 39 [2018-04-13 03:54:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:47,828 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2018-04-13 03:54:47,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 03:54:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2018-04-13 03:54:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 03:54:47,829 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:47,829 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:47,829 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:47,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1346524950, now seen corresponding path program 2 times [2018-04-13 03:54:47,829 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:47,829 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:47,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:47,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:47,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:47,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:47,838 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:47,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:47,838 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:47,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:54:47,849 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:54:47,849 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:47,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:47,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:47,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:47,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,865 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:54:47,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-13 03:54:47,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:47,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-13 03:54:47,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:47,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:47,904 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:47,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:47,908 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:54:47,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-04-13 03:54:48,110 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:54:48,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:54:48,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 03:54:48,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 03:54:48,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 03:54:48,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-04-13 03:54:48,145 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 18 states. [2018-04-13 03:54:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:48,597 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2018-04-13 03:54:48,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 03:54:48,597 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-04-13 03:54:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:48,598 INFO L225 Difference]: With dead ends: 168 [2018-04-13 03:54:48,598 INFO L226 Difference]: Without dead ends: 164 [2018-04-13 03:54:48,598 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:54:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-13 03:54:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 154. [2018-04-13 03:54:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-13 03:54:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2018-04-13 03:54:48,600 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 40 [2018-04-13 03:54:48,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:48,600 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2018-04-13 03:54:48,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 03:54:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2018-04-13 03:54:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 03:54:48,601 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:48,601 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:48,601 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1346515914, now seen corresponding path program 1 times [2018-04-13 03:54:48,601 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:48,601 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:48,602 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:48,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:54:48,602 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:48,607 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,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:48,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:48,825 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:48,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:48,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:48,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 03:54:48,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:48,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:54:48,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:48,873 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,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-13 03:54:48,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:48,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:48,917 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,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:48,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out 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,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:48,945 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:54:48,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-04-13 03:54:49,290 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:54:49,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:54:49,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-13 03:54:49,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 03:54:49,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 03:54:49,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:54:49,291 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand 33 states. [2018-04-13 03:54:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:54:50,033 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2018-04-13 03:54:50,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:54:50,033 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-04-13 03:54:50,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:54:50,034 INFO L225 Difference]: With dead ends: 177 [2018-04-13 03:54:50,034 INFO L226 Difference]: Without dead ends: 169 [2018-04-13 03:54:50,034 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=288, Invalid=2262, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 03:54:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-13 03:54:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2018-04-13 03:54:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-13 03:54:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 187 transitions. [2018-04-13 03:54:50,036 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 187 transitions. Word has length 40 [2018-04-13 03:54:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:54:50,036 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 187 transitions. [2018-04-13 03:54:50,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 03:54:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 187 transitions. [2018-04-13 03:54:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 03:54:50,036 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:54:50,036 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:54:50,037 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-13 03:54:50,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1926731901, now seen corresponding path program 6 times [2018-04-13 03:54:50,037 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:54:50,037 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:54:50,037 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:50,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:54:50,037 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:54:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:54:50,047 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:50,060 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:54:50,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:54:50,060 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:54:50,060 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:54:50,099 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-04-13 03:54:50,100 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:54:50,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:54:50,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:50,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,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:54:50,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:54:50,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:50,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:54:50,149 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:50,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out 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,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 03:54:50,211 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 19 treesize of output 16 [2018-04-13 03:54:50,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 03:54:50,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:50,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-13 03:54:50,239 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 32 treesize of output 33 [2018-04-13 03:54:50,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:54:50,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:50,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-13 03:54:50,431 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:54:50,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 03:54:50,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:67 [2018-04-13 03:54:50,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-04-13 03:54:50,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 03:54:50,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:54:50,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 48 treesize of output 203 [2018-04-13 03:54:50,743 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-04-13 03:54:50,936 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 32768 conjuctions. This might take some time... [2018-04-13 03:57:48,399 INFO L170 XnfTransformerHelper]: Simplified to disjunction of 32768 conjuctions. [2018-04-13 03:57:51,567 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 16896 xjuncts. Received shutdown request... [2018-04-13 04:06:04,038 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-13 04:06:04,039 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 04:06:04,042 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 04:06:04,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 04:06:04 BoogieIcfgContainer [2018-04-13 04:06:04,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 04:06:04,042 INFO L168 Benchmark]: Toolchain (without parser) took 776493.48 ms. Allocated memory was 397.4 MB in the beginning and 639.1 MB in the end (delta: 241.7 MB). Free memory was 334.8 MB in the beginning and 264.5 MB in the end (delta: 70.3 MB). Peak memory consumption was 819.4 MB. Max. memory is 5.3 GB. [2018-04-13 04:06:04,043 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 397.4 MB. Free memory is still 357.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 04:06:04,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.15 ms. Allocated memory is still 397.4 MB. Free memory was 334.8 MB in the beginning and 309.7 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:04,043 INFO L168 Benchmark]: Boogie Preprocessor took 44.75 ms. Allocated memory is still 397.4 MB. Free memory was 309.7 MB in the beginning and 307.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 04:06:04,044 INFO L168 Benchmark]: RCFGBuilder took 372.07 ms. Allocated memory was 397.4 MB in the beginning and 597.7 MB in the end (delta: 200.3 MB). Free memory was 307.0 MB in the beginning and 530.3 MB in the end (delta: -223.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-04-13 04:06:04,044 INFO L168 Benchmark]: TraceAbstraction took 775801.75 ms. Allocated memory was 597.7 MB in the beginning and 639.1 MB in the end (delta: 41.4 MB). Free memory was 530.3 MB in the beginning and 264.5 MB in the end (delta: 265.8 MB). Peak memory consumption was 814.7 MB. Max. memory is 5.3 GB. [2018-04-13 04:06:04,044 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.12 ms. Allocated memory is still 397.4 MB. Free memory is still 357.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 272.15 ms. Allocated memory is still 397.4 MB. Free memory was 334.8 MB in the beginning and 309.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.75 ms. Allocated memory is still 397.4 MB. Free memory was 309.7 MB in the beginning and 307.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 372.07 ms. Allocated memory was 397.4 MB in the beginning and 597.7 MB in the end (delta: 200.3 MB). Free memory was 307.0 MB in the beginning and 530.3 MB in the end (delta: -223.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 775801.75 ms. Allocated memory was 597.7 MB in the beginning and 639.1 MB in the end (delta: 41.4 MB). Free memory was 530.3 MB in the beginning and 264.5 MB in the end (delta: 265.8 MB). Peak memory consumption was 814.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 16953. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 15 error locations. TIMEOUT Result, 775.7s OverallTime, 31 OverallIterations, 8 TraceHistogramMax, 93.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1425 SDtfs, 2739 SDslu, 8306 SDs, 0 SdLazy, 7827 SolverSat, 685 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 40.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 878 GetRequests, 354 SyntacticMatches, 2 SemanticMatches, 522 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2604 ImplicationChecksByTransitivity, 57.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=21, 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.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 1710 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1416 NumberOfCodeBlocks, 1414 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 902 ConstructedInterpolants, 163 QuantifiedInterpolants, 395089 SizeOfPredicates, 220 NumberOfNonLiveVariables, 2743 ConjunctsInSsa, 737 ConjunctsInUnsatCore, 33 InterpolantComputations, 14 PerfectInterpolantSequences, 20/286 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/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_04-06-04-049.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_04-06-04-049.csv Completed graceful shutdown