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/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:16:20,215 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:16:20,216 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:16:20,228 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:16:20,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:16:20,229 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:16:20,230 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:16:20,231 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:16:20,233 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:16:20,233 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:16:20,234 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:16:20,234 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:16:20,235 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:16:20,236 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:16:20,237 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:16:20,238 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:16:20,239 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:16:20,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:16:20,242 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:16:20,243 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:16:20,244 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:16:20,244 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:16:20,245 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:16:20,245 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:16:20,246 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:16:20,247 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:16:20,247 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:16:20,248 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:16:20,248 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:16:20,248 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:16:20,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:16:20,249 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 15:16:20,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:16:20,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:16:20,269 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:16:20,269 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:16:20,269 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:16:20,269 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:16:20,269 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:16:20,269 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:16:20,269 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:16:20,270 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:16:20,270 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:16:20,270 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:16:20,270 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:16:20,270 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:16:20,270 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:16:20,270 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:16:20,270 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:16:20,270 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:16:20,270 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:16:20,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:16:20,271 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:16:20,271 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:16:20,271 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:16:20,271 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:16:20,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:16:20,308 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:16:20,311 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:16:20,312 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:16:20,312 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:16:20,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,604 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG31c0ddfc9 [2018-04-11 15:16:20,737 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:16:20,738 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:16:20,738 INFO L168 CDTParser]: Scanning openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,745 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:16:20,746 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:16:20,746 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:16:20,746 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,746 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,746 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpy ('cstrcpy') in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,746 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,746 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:16:20,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:20,770 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG31c0ddfc9 [2018-04-11 15:16:20,773 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:16:20,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:16:20,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:16:20,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:16:20,777 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:16:20,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:16:20" (1/1) ... [2018-04-11 15:16:20,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb0fac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:16:20, skipping insertion in model container [2018-04-11 15:16:20,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:16:20" (1/1) ... [2018-04-11 15:16:20,794 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:16:20,816 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:16:20,941 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:16:20,969 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:16:20,975 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 15:16:21,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:16:21 WrapperNode [2018-04-11 15:16:21,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:16:21,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:16:21,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:16:21,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:16:21,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:16:21" (1/1) ... [2018-04-11 15:16:21,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:16:21" (1/1) ... [2018-04-11 15:16:21,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:16:21" (1/1) ... [2018-04-11 15:16:21,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:16:21" (1/1) ... [2018-04-11 15:16:21,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:16:21" (1/1) ... [2018-04-11 15:16:21,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:16:21" (1/1) ... [2018-04-11 15:16:21,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:16:21" (1/1) ... [2018-04-11 15:16:21,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:16:21,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:16:21,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:16:21,050 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:16:21,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:16:21" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:16:21,137 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:16:21,137 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:16:21,137 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:16:21,137 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:16:21,137 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpy [2018-04-11 15:16:21,138 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:16:21,138 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:16:21,138 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:16:21,138 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:16:21,138 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:16:21,138 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:16:21,138 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:16:21,138 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:16:21,138 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:16:21,138 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:16:21,138 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:16:21,139 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:16:21,139 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:16:21,139 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:16:21,139 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:16:21,139 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:16:21,139 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:16:21,139 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:16:21,139 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:16:21,139 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:16:21,139 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:16:21,139 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:16:21,140 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:16:21,140 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:16:21,140 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:16:21,140 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:16:21,140 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:16:21,140 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:16:21,140 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:16:21,140 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:16:21,141 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:16:21,141 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:16:21,141 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:16:21,141 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:16:21,141 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:16:21,141 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:16:21,141 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:16:21,141 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:16:21,141 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:16:21,141 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:16:21,142 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:16:21,142 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:16:21,142 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:16:21,142 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:16:21,142 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:16:21,142 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:16:21,142 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:16:21,142 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:16:21,142 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:16:21,142 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:16:21,142 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:16:21,143 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:16:21,143 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:16:21,143 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:16:21,143 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:16:21,143 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:16:21,143 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:16:21,143 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:16:21,143 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:16:21,143 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:16:21,143 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:16:21,143 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:16:21,144 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:16:21,145 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:16:21,146 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:16:21,146 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:16:21,146 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:16:21,146 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:16:21,146 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:16:21,146 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:16:21,146 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:16:21,146 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:16:21,146 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpy [2018-04-11 15:16:21,146 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:16:21,147 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:16:21,147 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:16:21,147 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:16:21,147 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:16:21,147 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:16:21,147 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:16:21,147 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:16:21,385 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:16:21,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:16:21 BoogieIcfgContainer [2018-04-11 15:16:21,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:16:21,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:16:21,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:16:21,388 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:16:21,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:16:20" (1/3) ... [2018-04-11 15:16:21,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a41596f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:16:21, skipping insertion in model container [2018-04-11 15:16:21,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:16:21" (2/3) ... [2018-04-11 15:16:21,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a41596f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:16:21, skipping insertion in model container [2018-04-11 15:16:21,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:16:21" (3/3) ... [2018-04-11 15:16:21,390 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:16:21,395 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:16:21,400 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-04-11 15:16:21,428 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:16:21,429 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:16:21,429 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:16:21,429 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:16:21,429 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:16:21,429 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:16:21,429 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:16:21,429 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:16:21,429 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:16:21,429 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:16:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-04-11 15:16:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-11 15:16:21,442 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:21,442 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:21,442 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:21,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1015483767, now seen corresponding path program 1 times [2018-04-11 15:16:21,446 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:21,446 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:21,475 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:21,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:21,475 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:21,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:21,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:21,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:16:21,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:16:21,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:16:21,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:16:21,563 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-04-11 15:16:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:21,603 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-11 15:16:21,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:16:21,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-04-11 15:16:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:21,610 INFO L225 Difference]: With dead ends: 44 [2018-04-11 15:16:21,610 INFO L226 Difference]: Without dead ends: 40 [2018-04-11 15:16:21,611 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:16:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-04-11 15:16:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-04-11 15:16:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-11 15:16:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-04-11 15:16:21,631 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-04-11 15:16:21,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:21,631 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-04-11 15:16:21,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:16:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-04-11 15:16:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-11 15:16:21,631 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:21,632 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:21,632 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:21,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1015485689, now seen corresponding path program 1 times [2018-04-11 15:16:21,632 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:21,632 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:21,633 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:21,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:21,633 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:21,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:21,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:21,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 15:16:21,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:16:21,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:16:21,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:16:21,656 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-04-11 15:16:21,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:21,692 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-04-11 15:16:21,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:16:21,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-04-11 15:16:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:21,693 INFO L225 Difference]: With dead ends: 39 [2018-04-11 15:16:21,693 INFO L226 Difference]: Without dead ends: 38 [2018-04-11 15:16:21,694 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-11 15:16:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-11 15:16:21,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-04-11 15:16:21,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-11 15:16:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-04-11 15:16:21,697 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-04-11 15:16:21,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:21,698 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-04-11 15:16:21,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:16:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-04-11 15:16:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:16:21,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:21,698 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:21,698 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:21,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1606378251, now seen corresponding path program 1 times [2018-04-11 15:16:21,699 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:21,699 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:21,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:21,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:21,700 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:21,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:21,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:21,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:16:21,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:16:21,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:16:21,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:16:21,738 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-04-11 15:16:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:21,777 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-04-11 15:16:21,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:16:21,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 15:16:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:21,778 INFO L225 Difference]: With dead ends: 36 [2018-04-11 15:16:21,778 INFO L226 Difference]: Without dead ends: 36 [2018-04-11 15:16:21,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:16:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-04-11 15:16:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-04-11 15:16:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-11 15:16:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-11 15:16:21,781 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-04-11 15:16:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:21,781 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-11 15:16:21,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:16:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-11 15:16:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:16:21,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:21,781 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:21,781 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:21,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1606378252, now seen corresponding path program 1 times [2018-04-11 15:16:21,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:21,781 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:21,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:21,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:21,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:21,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:21,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:21,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:16:21,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:16:21,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:16:21,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:16:21,839 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-04-11 15:16:21,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:21,875 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-04-11 15:16:21,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:16:21,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 15:16:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:21,876 INFO L225 Difference]: With dead ends: 35 [2018-04-11 15:16:21,876 INFO L226 Difference]: Without dead ends: 35 [2018-04-11 15:16:21,876 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:16:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-04-11 15:16:21,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-04-11 15:16:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-04-11 15:16:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-04-11 15:16:21,878 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-04-11 15:16:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:21,878 INFO L459 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-04-11 15:16:21,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:16:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-04-11 15:16:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:16:21,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:21,879 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:21,879 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:21,880 INFO L82 PathProgramCache]: Analyzing trace with hash -603948622, now seen corresponding path program 1 times [2018-04-11 15:16:21,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:21,880 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:21,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:21,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:21,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:21,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:21,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:21,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:16:21,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:16:21,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:16:21,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:16:21,922 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-04-11 15:16:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:21,973 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-04-11 15:16:21,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:16:21,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 15:16:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:21,974 INFO L225 Difference]: With dead ends: 34 [2018-04-11 15:16:21,974 INFO L226 Difference]: Without dead ends: 34 [2018-04-11 15:16:21,974 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:16:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-04-11 15:16:21,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-04-11 15:16:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-04-11 15:16:21,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-04-11 15:16:21,976 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-04-11 15:16:21,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:21,976 INFO L459 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-04-11 15:16:21,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:16:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-04-11 15:16:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:16:21,977 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:21,977 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:21,977 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:21,977 INFO L82 PathProgramCache]: Analyzing trace with hash -603948621, now seen corresponding path program 1 times [2018-04-11 15:16:21,978 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:21,978 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:21,978 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:21,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:21,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:21,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:22,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:22,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:16:22,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:16:22,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:16:22,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:16:22,073 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-04-11 15:16:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:22,138 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-11 15:16:22,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:16:22,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-11 15:16:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:22,140 INFO L225 Difference]: With dead ends: 44 [2018-04-11 15:16:22,140 INFO L226 Difference]: Without dead ends: 44 [2018-04-11 15:16:22,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:16:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-11 15:16:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-04-11 15:16:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-11 15:16:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-11 15:16:22,144 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-04-11 15:16:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:22,144 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-11 15:16:22,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:16:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-11 15:16:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:16:22,144 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:22,144 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:22,144 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:22,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1542538081, now seen corresponding path program 1 times [2018-04-11 15:16:22,145 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:22,145 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:22,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:22,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:22,146 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:22,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:22,163 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:22,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:22,163 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:22,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:22,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:22,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:22,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:22,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:22,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:16:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2018-04-11 15:16:22,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:22,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:22,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-04-11 15:16:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:22,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:22,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 15:16:22,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:16:22,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:16:22,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:16:22,339 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 11 states. [2018-04-11 15:16:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:22,581 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-04-11 15:16:22,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:16:22,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-04-11 15:16:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:22,583 INFO L225 Difference]: With dead ends: 86 [2018-04-11 15:16:22,583 INFO L226 Difference]: Without dead ends: 86 [2018-04-11 15:16:22,584 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:16:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-11 15:16:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-04-11 15:16:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 15:16:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-04-11 15:16:22,591 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 19 [2018-04-11 15:16:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:22,591 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-04-11 15:16:22,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:16:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-04-11 15:16:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:16:22,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:22,592 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:22,592 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:22,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1542538082, now seen corresponding path program 1 times [2018-04-11 15:16:22,592 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:22,592 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:22,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:22,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:22,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:22,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:22,606 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:22,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:22,606 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:22,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:22,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:22,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:22,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:22,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:22,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:16:22,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:16:22,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:22,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:22,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 15:16:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:22,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:22,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:16:22,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:16:22,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:16:22,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:16:22,650 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 6 states. [2018-04-11 15:16:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:22,690 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-04-11 15:16:22,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:16:22,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-04-11 15:16:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:22,690 INFO L225 Difference]: With dead ends: 55 [2018-04-11 15:16:22,690 INFO L226 Difference]: Without dead ends: 55 [2018-04-11 15:16:22,691 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:16:22,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-11 15:16:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-11 15:16:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:16:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-04-11 15:16:22,693 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 19 [2018-04-11 15:16:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:22,693 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-04-11 15:16:22,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:16:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-04-11 15:16:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:16:22,694 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:22,694 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:22,694 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:22,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1284372643, now seen corresponding path program 1 times [2018-04-11 15:16:22,694 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:22,695 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:22,695 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:22,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:22,695 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:22,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:22,707 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:22,708 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:22,708 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:22,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:22,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:22,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:22,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:22,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:22,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-11 15:16:22,785 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:16:22,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2018-04-11 15:16:22,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:22,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:22,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 15:16:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:22,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:22,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:16:22,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:16:22,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:16:22,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:16:22,851 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 12 states. [2018-04-11 15:16:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:23,068 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-04-11 15:16:23,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:16:23,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-04-11 15:16:23,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:23,069 INFO L225 Difference]: With dead ends: 93 [2018-04-11 15:16:23,069 INFO L226 Difference]: Without dead ends: 93 [2018-04-11 15:16:23,069 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:16:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-11 15:16:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2018-04-11 15:16:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:16:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-04-11 15:16:23,072 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 19 [2018-04-11 15:16:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:23,072 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-04-11 15:16:23,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:16:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-04-11 15:16:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:16:23,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:23,073 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:23,073 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash -2129344095, now seen corresponding path program 1 times [2018-04-11 15:16:23,073 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:23,073 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:23,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:23,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:23,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:23,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:23,084 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:23,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:23,085 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:23,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:23,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:23,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:23,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:23,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:23,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:23,126 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-11 15:16:23,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-11 15:16:23,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:23,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:23,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:23,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:23,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:23,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:23,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:23,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 15:16:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:23,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:23,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:16:23,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:16:23,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:16:23,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:16:23,241 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 12 states. [2018-04-11 15:16:23,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:23,499 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-04-11 15:16:23,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:16:23,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-04-11 15:16:23,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:23,500 INFO L225 Difference]: With dead ends: 112 [2018-04-11 15:16:23,500 INFO L226 Difference]: Without dead ends: 112 [2018-04-11 15:16:23,500 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:16:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-11 15:16:23,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 55. [2018-04-11 15:16:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:16:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-04-11 15:16:23,507 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 19 [2018-04-11 15:16:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:23,507 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-04-11 15:16:23,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:16:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-04-11 15:16:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:16:23,508 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:23,508 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:23,508 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:23,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1871178657, now seen corresponding path program 1 times [2018-04-11 15:16:23,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:23,509 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:23,509 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:23,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:23,509 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:23,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:23,519 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:23,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:23,519 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:23,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:23,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:23,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:23,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:23,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:23,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:23,551 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-11 15:16:23,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:23,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:23,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:23,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:23,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:23,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:23,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:23,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:23,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:23,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:16:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:23,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:23,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:16:23,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:16:23,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:16:23,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:16:23,594 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 8 states. [2018-04-11 15:16:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:23,662 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-04-11 15:16:23,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:16:23,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-04-11 15:16:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:23,663 INFO L225 Difference]: With dead ends: 66 [2018-04-11 15:16:23,663 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 15:16:23,663 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:16:23,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 15:16:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 36. [2018-04-11 15:16:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-11 15:16:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-11 15:16:23,665 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-04-11 15:16:23,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:23,665 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-11 15:16:23,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:16:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-11 15:16:23,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:16:23,665 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:23,666 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-11 15:16:23,666 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:23,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1326322050, now seen corresponding path program 1 times [2018-04-11 15:16:23,666 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:23,666 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:23,666 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:23,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:23,666 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:23,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:23,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:23,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 15:16:23,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:16:23,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:16:23,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:16:23,749 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-04-11 15:16:23,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:23,826 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-04-11 15:16:23,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:16:23,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-04-11 15:16:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:23,826 INFO L225 Difference]: With dead ends: 58 [2018-04-11 15:16:23,826 INFO L226 Difference]: Without dead ends: 58 [2018-04-11 15:16:23,826 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:16:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-11 15:16:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-04-11 15:16:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:16:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-04-11 15:16:23,828 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2018-04-11 15:16:23,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:23,828 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-04-11 15:16:23,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:16:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-04-11 15:16:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:16:23,829 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:23,829 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-11 15:16:23,829 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:23,829 INFO L82 PathProgramCache]: Analyzing trace with hash 305253696, now seen corresponding path program 1 times [2018-04-11 15:16:23,829 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:23,829 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:23,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:23,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:23,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:23,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:23,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:23,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 15:16:23,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:16:23,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:16:23,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:16:23,924 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 12 states. [2018-04-11 15:16:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:24,045 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2018-04-11 15:16:24,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:16:24,045 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-04-11 15:16:24,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:24,046 INFO L225 Difference]: With dead ends: 88 [2018-04-11 15:16:24,046 INFO L226 Difference]: Without dead ends: 88 [2018-04-11 15:16:24,046 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:16:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-11 15:16:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2018-04-11 15:16:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 15:16:24,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-04-11 15:16:24,048 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 23 [2018-04-11 15:16:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:24,048 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-04-11 15:16:24,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:16:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-04-11 15:16:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:16:24,049 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:24,049 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-11 15:16:24,049 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:24,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1283094206, now seen corresponding path program 1 times [2018-04-11 15:16:24,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:24,049 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:24,049 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:24,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:24,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:24,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:24,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:24,177 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:24,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:24,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:24,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-11 15:16:24,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:24,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:24,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:16:24,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:16:24,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:16:24,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:24,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:24,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:24,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:16:24,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-11 15:16:24,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:16:24,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:24,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:24,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:24,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-04-11 15:16:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:24,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:16:24,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-04-11 15:16:24,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:16:24,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:16:24,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:16:24,350 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 19 states. [2018-04-11 15:16:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:24,621 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-04-11 15:16:24,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:16:24,621 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-04-11 15:16:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:24,621 INFO L225 Difference]: With dead ends: 66 [2018-04-11 15:16:24,621 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 15:16:24,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:16:24,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 15:16:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-04-11 15:16:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 15:16:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-04-11 15:16:24,625 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 23 [2018-04-11 15:16:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:24,626 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-04-11 15:16:24,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:16:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-04-11 15:16:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:16:24,626 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:24,626 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] [2018-04-11 15:16:24,626 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1121214736, now seen corresponding path program 1 times [2018-04-11 15:16:24,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:24,626 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:24,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:24,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:24,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:24,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:24,634 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:24,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:24,634 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:24,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:24,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:24,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:24,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:24,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:24,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:24,680 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-11 15:16:24,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-11 15:16:24,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:24,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:24,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:24,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:24,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:24,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:24,706 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-11 15:16:24,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2018-04-11 15:16:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:24,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:24,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 15:16:24,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:16:24,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:16:24,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:16:24,798 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 14 states. [2018-04-11 15:16:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:25,077 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-04-11 15:16:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:16:25,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-04-11 15:16:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:25,078 INFO L225 Difference]: With dead ends: 65 [2018-04-11 15:16:25,078 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 15:16:25,078 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:16:25,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 15:16:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-04-11 15:16:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 15:16:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-04-11 15:16:25,081 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 24 [2018-04-11 15:16:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:25,081 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-04-11 15:16:25,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:16:25,081 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-04-11 15:16:25,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:16:25,082 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:25,082 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:25,082 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:25,082 INFO L82 PathProgramCache]: Analyzing trace with hash -278961325, now seen corresponding path program 2 times [2018-04-11 15:16:25,082 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:25,082 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:25,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:25,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:25,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:25,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:25,098 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:25,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:25,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:25,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:16:25,117 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:16:25,117 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:25,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:25,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:25,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:16:25,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:25,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:25,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-11 15:16:25,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:25,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:16:25,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:16:25,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 13 treesize of output 12 [2018-04-11 15:16:25,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-04-11 15:16:25,274 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 31 treesize of output 32 [2018-04-11 15:16:25,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:16:25,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,298 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-11 15:16:25,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-11 15:16:25,397 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 43 treesize of output 37 [2018-04-11 15:16:25,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:25,407 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-04-11 15:16:25,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:25,426 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-11 15:16:25,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,428 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-04-11 15:16:25,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:25,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:25,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:95 [2018-04-11 15:16:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:25,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:25,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:16:25,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:16:25,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:16:25,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:16:25,534 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 16 states. [2018-04-11 15:16:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:25,923 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-04-11 15:16:25,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:16:25,923 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-04-11 15:16:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:25,924 INFO L225 Difference]: With dead ends: 71 [2018-04-11 15:16:25,924 INFO L226 Difference]: Without dead ends: 71 [2018-04-11 15:16:25,925 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:16:25,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-11 15:16:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2018-04-11 15:16:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-11 15:16:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-04-11 15:16:25,926 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 28 [2018-04-11 15:16:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:25,927 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-04-11 15:16:25,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:16:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-04-11 15:16:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:16:25,928 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:25,928 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] [2018-04-11 15:16:25,928 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2129258862, now seen corresponding path program 1 times [2018-04-11 15:16:25,929 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:25,929 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:25,929 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:25,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:25,929 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:25,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:25,938 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:25,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:25,939 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:25,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:25,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:25,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:25,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-11 15:16:25,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 15:16:25,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:25,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:16:26,019 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc7.base| 1))) (and (= (select |c_old(#valid)| |main_#t~malloc7.base|) 0) (= (store (store .cse0 |c_main_#t~malloc8.base| 1) |main_#t~malloc7.base| 0) |c_#valid|) (= (select .cse0 |c_main_#t~malloc8.base|) 0)))) is different from true [2018-04-11 15:16:26,022 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int) (|main_#t~malloc8.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc7.base| 1))) (and (= (select |c_old(#valid)| |main_#t~malloc7.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc8.base| 1) |main_#t~malloc7.base| 0) |main_#t~malloc8.base| 0)) (= (select .cse0 |main_#t~malloc8.base|) 0)))) is different from true [2018-04-11 15:16:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:26,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:16:26,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:16:26,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:16:26,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:16:26,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-11 15:16:26,025 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 8 states. [2018-04-11 15:16:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:26,066 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-04-11 15:16:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:16:26,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-04-11 15:16:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:26,066 INFO L225 Difference]: With dead ends: 60 [2018-04-11 15:16:26,066 INFO L226 Difference]: Without dead ends: 35 [2018-04-11 15:16:26,067 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-11 15:16:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-04-11 15:16:26,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-04-11 15:16:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-04-11 15:16:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-04-11 15:16:26,068 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 29 [2018-04-11 15:16:26,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:26,068 INFO L459 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-04-11 15:16:26,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:16:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-04-11 15:16:26,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:16:26,069 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:26,069 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:26,069 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:26,070 INFO L82 PathProgramCache]: Analyzing trace with hash -57866497, now seen corresponding path program 2 times [2018-04-11 15:16:26,070 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:26,070 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:26,070 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:26,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:26,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:26,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:26,099 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:26,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:26,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:26,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:16:26,129 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:16:26,129 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:26,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:26,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:26,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:26,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,171 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-11 15:16:26,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:26,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:26,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:26,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:26,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:26,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,199 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-11 15:16:26,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:16:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:26,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:26,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 15:16:26,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:16:26,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:16:26,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:16:26,291 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 13 states. [2018-04-11 15:16:26,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:26,524 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-04-11 15:16:26,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:16:26,525 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-04-11 15:16:26,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:26,525 INFO L225 Difference]: With dead ends: 38 [2018-04-11 15:16:26,525 INFO L226 Difference]: Without dead ends: 38 [2018-04-11 15:16:26,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:16:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-11 15:16:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-04-11 15:16:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-11 15:16:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-04-11 15:16:26,526 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 29 [2018-04-11 15:16:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:26,526 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-04-11 15:16:26,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:16:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-04-11 15:16:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:16:26,527 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:26,527 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:26,527 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1352674274, now seen corresponding path program 3 times [2018-04-11 15:16:26,527 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:26,527 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:26,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:26,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:26,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:26,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:26,544 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:26,545 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:26,545 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:26,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:16:26,585 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:16:26,585 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:26,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:26,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:26,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:16:26,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:26,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:26,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:26,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:26,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 15:16:26,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:16:26,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:16:26,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:16:26,684 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-11 15:16:26,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:16:26,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-11 15:16:26,728 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-11 15:16:26,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:16:26,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2018-04-11 15:16:26,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:16:26,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:16:26,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:26,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:26,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:26,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2018-04-11 15:16:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:26,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:26,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:16:26,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:16:26,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:16:26,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:16:26,830 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 16 states. [2018-04-11 15:16:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:27,030 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-04-11 15:16:27,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:16:27,030 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-04-11 15:16:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:27,030 INFO L225 Difference]: With dead ends: 44 [2018-04-11 15:16:27,030 INFO L226 Difference]: Without dead ends: 44 [2018-04-11 15:16:27,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:16:27,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-11 15:16:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-04-11 15:16:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-04-11 15:16:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-04-11 15:16:27,031 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 33 [2018-04-11 15:16:27,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:27,032 INFO L459 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-04-11 15:16:27,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:16:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-04-11 15:16:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:16:27,032 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:27,032 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:27,032 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1016770480, now seen corresponding path program 3 times [2018-04-11 15:16:27,032 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:27,032 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:27,033 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:27,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:27,033 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:27,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:27,042 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:27,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:27,043 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:27,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:16:27,083 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:16:27,083 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:27,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:27,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:27,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:16:27,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:16:27,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:27,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:16:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:27,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:27,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 15:16:27,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:16:27,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:16:27,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:16:27,273 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 14 states. [2018-04-11 15:16:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:27,520 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-04-11 15:16:27,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:16:27,520 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-04-11 15:16:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:27,520 INFO L225 Difference]: With dead ends: 43 [2018-04-11 15:16:27,520 INFO L226 Difference]: Without dead ends: 43 [2018-04-11 15:16:27,521 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:16:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-11 15:16:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-04-11 15:16:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-04-11 15:16:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-04-11 15:16:27,522 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 34 [2018-04-11 15:16:27,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:27,522 INFO L459 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-04-11 15:16:27,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:16:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-04-11 15:16:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:16:27,522 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:27,522 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:27,522 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:27,522 INFO L82 PathProgramCache]: Analyzing trace with hash -190749517, now seen corresponding path program 4 times [2018-04-11 15:16:27,522 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:27,523 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:27,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:27,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:27,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:27,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:27,541 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:27,541 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:27,541 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:27,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:16:27,561 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:16:27,561 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:27,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:27,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-11 15:16:27,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:16:27,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:27,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:27,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:27,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:27,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:16:27,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:16:27,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:16:27,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 15:16:27,723 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-11 15:16:27,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:16:27,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-11 15:16:27,760 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-11 15:16:27,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:16:27,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-11 15:16:27,798 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-11 15:16:27,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:16:27,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,812 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-11 15:16:27,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-11 15:16:27,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:16:27,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:16:27,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:27,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:27,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:27,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-11 15:16:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:27,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:27,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:16:27,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:16:27,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:16:27,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:16:27,905 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 17 states. [2018-04-11 15:16:28,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:28,197 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-04-11 15:16:28,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:16:28,198 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-04-11 15:16:28,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:28,198 INFO L225 Difference]: With dead ends: 42 [2018-04-11 15:16:28,198 INFO L226 Difference]: Without dead ends: 42 [2018-04-11 15:16:28,198 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:16:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-04-11 15:16:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-04-11 15:16:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-04-11 15:16:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-04-11 15:16:28,199 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-04-11 15:16:28,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:28,199 INFO L459 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-04-11 15:16:28,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:16:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-04-11 15:16:28,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:16:28,200 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:28,200 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:28,200 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:28,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1618267745, now seen corresponding path program 4 times [2018-04-11 15:16:28,200 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:28,200 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:28,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:28,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:28,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:28,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:28,220 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:28,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:28,220 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:28,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:16:28,250 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:16:28,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:28,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:28,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:28,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:28,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:28,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:28,282 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-11 15:16:28,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:28,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:28,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:28,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:28,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:28,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:28,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:28,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:28,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:28,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:16:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:28,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:28,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:16:28,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:16:28,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:16:28,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:16:28,477 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 16 states. [2018-04-11 15:16:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:28,815 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-04-11 15:16:28,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:16:28,816 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-04-11 15:16:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:28,816 INFO L225 Difference]: With dead ends: 47 [2018-04-11 15:16:28,816 INFO L226 Difference]: Without dead ends: 47 [2018-04-11 15:16:28,817 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:16:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-11 15:16:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-04-11 15:16:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-11 15:16:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-04-11 15:16:28,818 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 39 [2018-04-11 15:16:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:28,818 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-04-11 15:16:28,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:16:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-04-11 15:16:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:16:28,819 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:28,819 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:28,819 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:28,819 INFO L82 PathProgramCache]: Analyzing trace with hash 196659632, now seen corresponding path program 5 times [2018-04-11 15:16:28,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:28,819 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:28,820 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:28,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:28,820 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:28,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:28,845 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:28,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:28,845 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:28,846 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:16:28,897 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:16:28,898 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:28,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:28,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:28,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:28,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:28,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:28,918 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-11 15:16:28,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:28,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:28,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:28,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:16:28,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:28,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:28,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:28,948 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-11 15:16:28,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-11 15:16:29,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:29,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:29,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:29,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-04-11 15:16:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:29,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:29,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:16:29,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:16:29,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:16:29,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:16:29,164 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 16 states. [2018-04-11 15:16:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:29,565 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-04-11 15:16:29,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:16:29,565 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-04-11 15:16:29,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:29,565 INFO L225 Difference]: With dead ends: 52 [2018-04-11 15:16:29,565 INFO L226 Difference]: Without dead ends: 52 [2018-04-11 15:16:29,566 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:16:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-11 15:16:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-04-11 15:16:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:16:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-04-11 15:16:29,568 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2018-04-11 15:16:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:29,568 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-04-11 15:16:29,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:16:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-04-11 15:16:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:16:29,569 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:29,569 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:29,569 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:29,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1320381377, now seen corresponding path program 6 times [2018-04-11 15:16:29,569 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:29,569 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:29,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:29,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:29,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:29,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:29,597 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:29,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:29,597 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:29,598 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:16:29,656 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:16:29,656 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:29,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:29,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:29,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:29,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:29,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:29,689 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-11 15:16:29,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:29,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:29,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:29,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:29,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:29,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:29,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:29,725 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-11 15:16:29,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:16:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:29,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:29,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:16:29,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:16:29,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:16:29,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:16:29,960 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2018-04-11 15:16:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:30,416 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-04-11 15:16:30,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:16:30,416 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-04-11 15:16:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:30,417 INFO L225 Difference]: With dead ends: 57 [2018-04-11 15:16:30,417 INFO L226 Difference]: Without dead ends: 57 [2018-04-11 15:16:30,417 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:16:30,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-11 15:16:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-04-11 15:16:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:16:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-04-11 15:16:30,418 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 49 [2018-04-11 15:16:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:30,418 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-04-11 15:16:30,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:16:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-04-11 15:16:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:16:30,419 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:30,419 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:30,419 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:30,419 INFO L82 PathProgramCache]: Analyzing trace with hash 915147536, now seen corresponding path program 7 times [2018-04-11 15:16:30,419 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:30,419 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:30,419 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:30,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:30,420 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:30,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:30,444 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:30,444 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:30,445 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:30,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:30,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:30,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:30,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:30,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:30,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:30,485 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-11 15:16:30,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:30,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:30,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:30,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:30,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:30,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:30,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:30,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:30,514 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-11 15:16:30,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:16:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:30,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:30,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:16:30,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:16:30,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:16:30,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:16:30,744 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 18 states. [2018-04-11 15:16:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:31,288 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-04-11 15:16:31,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:16:31,289 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-04-11 15:16:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:31,289 INFO L225 Difference]: With dead ends: 62 [2018-04-11 15:16:31,289 INFO L226 Difference]: Without dead ends: 62 [2018-04-11 15:16:31,289 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:16:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-11 15:16:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-04-11 15:16:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 15:16:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-04-11 15:16:31,291 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 54 [2018-04-11 15:16:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:31,291 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-04-11 15:16:31,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:16:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-04-11 15:16:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:16:31,291 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:31,291 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:31,291 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:31,291 INFO L82 PathProgramCache]: Analyzing trace with hash -517263649, now seen corresponding path program 8 times [2018-04-11 15:16:31,292 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:31,292 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:31,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:31,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:31,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:31,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:31,304 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:31,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:31,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:31,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:16:31,340 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:16:31,340 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:31,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:31,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:31,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:31,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:31,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:16:31,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:16:31,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:31,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:31,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:16:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:31,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:31,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:16:31,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:16:31,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:16:31,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:16:31,620 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 19 states. [2018-04-11 15:16:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:32,030 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-04-11 15:16:32,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:16:32,031 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-04-11 15:16:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:32,031 INFO L225 Difference]: With dead ends: 67 [2018-04-11 15:16:32,031 INFO L226 Difference]: Without dead ends: 67 [2018-04-11 15:16:32,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:16:32,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-11 15:16:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-04-11 15:16:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-11 15:16:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-04-11 15:16:32,032 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 59 [2018-04-11 15:16:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:32,033 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-04-11 15:16:32,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:16:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-04-11 15:16:32,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:16:32,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:32,033 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:32,033 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:32,033 INFO L82 PathProgramCache]: Analyzing trace with hash 482677872, now seen corresponding path program 9 times [2018-04-11 15:16:32,033 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:32,033 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:32,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:32,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:32,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:32,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:32,055 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:32,055 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:32,055 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:32,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:16:32,126 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:16:32,126 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:32,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:32,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:32,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:32,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:32,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:16:32,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:16:32,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:32,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:32,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:16:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:32,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:32,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:16:32,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:16:32,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:16:32,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:16:32,465 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 21 states. [2018-04-11 15:16:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:33,003 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-04-11 15:16:33,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:16:33,003 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-04-11 15:16:33,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:33,004 INFO L225 Difference]: With dead ends: 72 [2018-04-11 15:16:33,004 INFO L226 Difference]: Without dead ends: 72 [2018-04-11 15:16:33,004 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:16:33,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-11 15:16:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-04-11 15:16:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-11 15:16:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-04-11 15:16:33,006 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 64 [2018-04-11 15:16:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:33,006 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-04-11 15:16:33,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:16:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-04-11 15:16:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:16:33,006 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:33,006 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:33,006 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash -167706241, now seen corresponding path program 10 times [2018-04-11 15:16:33,007 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:33,007 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:33,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:33,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:33,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:33,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:33,023 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:33,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:33,024 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:33,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:16:33,049 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:16:33,049 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:33,053 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:33,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:33,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:33,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:33,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:33,073 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-11 15:16:33,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:33,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:33,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:33,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:33,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:33,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:33,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:33,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:33,119 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-11 15:16:33,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:16:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:33,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:33,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:16:33,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:16:33,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:16:33,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:16:33,455 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 22 states. [2018-04-11 15:16:34,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:34,164 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-04-11 15:16:34,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:16:34,164 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-04-11 15:16:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:34,165 INFO L225 Difference]: With dead ends: 77 [2018-04-11 15:16:34,165 INFO L226 Difference]: Without dead ends: 77 [2018-04-11 15:16:34,165 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=1427, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:16:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-11 15:16:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-04-11 15:16:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 15:16:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-04-11 15:16:34,166 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 69 [2018-04-11 15:16:34,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:34,166 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-04-11 15:16:34,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:16:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-04-11 15:16:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:16:34,167 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:34,167 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:34,167 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:34,167 INFO L82 PathProgramCache]: Analyzing trace with hash 801760720, now seen corresponding path program 11 times [2018-04-11 15:16:34,167 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:34,167 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:34,168 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:34,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:34,168 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:34,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:34,263 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:34,263 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:34,263 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:34,264 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:16:34,363 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-11 15:16:34,364 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:34,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:34,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:34,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:34,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:34,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:34,398 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-11 15:16:34,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:34,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:34,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:34,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:16:34,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:34,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:34,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:34,437 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-11 15:16:34,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-11 15:16:34,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:16:34,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:34,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:34,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-11 15:16:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:34,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:34,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:16:34,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:16:34,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:16:34,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:16:34,881 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 23 states. [2018-04-11 15:16:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:35,728 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-04-11 15:16:35,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:16:35,728 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2018-04-11 15:16:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:35,729 INFO L225 Difference]: With dead ends: 82 [2018-04-11 15:16:35,729 INFO L226 Difference]: Without dead ends: 82 [2018-04-11 15:16:35,729 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=1506, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:16:35,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-11 15:16:35,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-04-11 15:16:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-11 15:16:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-04-11 15:16:35,732 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 74 [2018-04-11 15:16:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:35,733 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-04-11 15:16:35,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:16:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-04-11 15:16:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:16:35,738 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:35,739 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:35,739 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:35,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1848118303, now seen corresponding path program 12 times [2018-04-11 15:16:35,739 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:35,739 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:35,740 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:35,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:35,740 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:35,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:35,806 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:35,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:35,806 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:35,807 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:16:35,878 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-11 15:16:35,878 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:35,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:35,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:35,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:35,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:35,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:16:35,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:16:35,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:35,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:35,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:16:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:36,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:36,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:16:36,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:16:36,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:16:36,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:16:36,196 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 23 states. [2018-04-11 15:16:36,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:36,845 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-04-11 15:16:36,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:16:36,845 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2018-04-11 15:16:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:36,845 INFO L225 Difference]: With dead ends: 87 [2018-04-11 15:16:36,845 INFO L226 Difference]: Without dead ends: 87 [2018-04-11 15:16:36,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=1586, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:16:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-11 15:16:36,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-04-11 15:16:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 15:16:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-04-11 15:16:36,848 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 79 [2018-04-11 15:16:36,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:36,849 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-04-11 15:16:36,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:16:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-04-11 15:16:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:16:36,849 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:36,850 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:36,850 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:36,850 INFO L82 PathProgramCache]: Analyzing trace with hash -645890256, now seen corresponding path program 13 times [2018-04-11 15:16:36,850 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:36,850 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:36,851 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:36,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:36,851 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:36,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:36,947 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:36,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:36,947 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:36,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:37,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:37,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:37,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:37,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:37,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:37,032 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-11 15:16:37,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:37,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:37,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:37,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:37,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:37,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:37,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:37,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:37,065 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-11 15:16:37,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:16:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:37,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:37,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:16:37,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:16:37,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:16:37,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:16:37,505 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 25 states. [2018-04-11 15:16:38,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:38,348 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-04-11 15:16:38,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:16:38,348 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 84 [2018-04-11 15:16:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:38,349 INFO L225 Difference]: With dead ends: 92 [2018-04-11 15:16:38,349 INFO L226 Difference]: Without dead ends: 92 [2018-04-11 15:16:38,349 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=1919, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:16:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-11 15:16:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-04-11 15:16:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-11 15:16:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-04-11 15:16:38,351 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 84 [2018-04-11 15:16:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:38,352 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-04-11 15:16:38,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:16:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-04-11 15:16:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-11 15:16:38,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:38,353 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:38,353 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash 528109247, now seen corresponding path program 14 times [2018-04-11 15:16:38,354 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:38,354 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:38,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:38,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:38,355 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:38,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:38,464 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:38,464 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:38,464 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:38,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:16:38,590 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:16:38,591 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:38,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:38,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:38,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:38,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:38,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:38,622 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-11 15:16:38,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:38,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:38,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:38,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:38,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:38,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:38,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:38,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:38,656 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-11 15:16:38,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:16:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:39,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:39,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:16:39,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:16:39,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:16:39,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:16:39,149 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 26 states. [2018-04-11 15:16:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:39,963 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-04-11 15:16:39,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:16:39,963 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2018-04-11 15:16:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:39,964 INFO L225 Difference]: With dead ends: 97 [2018-04-11 15:16:39,964 INFO L226 Difference]: Without dead ends: 97 [2018-04-11 15:16:39,964 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=157, Invalid=2099, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 15:16:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-11 15:16:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-04-11 15:16:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-11 15:16:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-04-11 15:16:39,966 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 89 [2018-04-11 15:16:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:39,966 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-04-11 15:16:39,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:16:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-04-11 15:16:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-11 15:16:39,966 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:39,966 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:39,966 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:39,967 INFO L82 PathProgramCache]: Analyzing trace with hash -598810480, now seen corresponding path program 15 times [2018-04-11 15:16:39,967 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:39,967 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:39,967 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:39,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:39,967 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:39,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:40,039 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:40,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:40,039 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:40,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:16:40,157 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-11 15:16:40,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:40,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:40,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:40,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:40,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:40,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:16:40,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:16:40,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:40,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:40,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:16:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:40,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:40,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:16:40,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:16:40,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:16:40,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:16:40,603 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 28 states. [2018-04-11 15:16:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:41,446 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-04-11 15:16:41,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:16:41,446 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2018-04-11 15:16:41,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:41,447 INFO L225 Difference]: With dead ends: 102 [2018-04-11 15:16:41,447 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 15:16:41,447 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=2477, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:16:41,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 15:16:41,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-04-11 15:16:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 15:16:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-04-11 15:16:41,450 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 94 [2018-04-11 15:16:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:41,450 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-04-11 15:16:41,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:16:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-04-11 15:16:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-11 15:16:41,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:41,451 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:41,451 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:41,451 INFO L82 PathProgramCache]: Analyzing trace with hash -682505889, now seen corresponding path program 16 times [2018-04-11 15:16:41,451 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:41,451 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:41,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:41,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:41,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:41,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:41,478 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:41,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:41,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:41,479 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:16:41,604 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:16:41,604 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:41,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:41,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:41,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:41,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:41,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:41,634 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-11 15:16:41,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:41,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:41,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:41,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:41,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:41,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:41,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:41,666 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-11 15:16:41,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:16:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:42,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:42,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:16:42,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:16:42,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:16:42,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=700, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:16:42,097 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 28 states. [2018-04-11 15:16:43,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:43,142 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-04-11 15:16:43,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:16:43,142 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 99 [2018-04-11 15:16:43,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:43,142 INFO L225 Difference]: With dead ends: 107 [2018-04-11 15:16:43,142 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 15:16:43,143 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=2480, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:16:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 15:16:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-04-11 15:16:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-11 15:16:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-04-11 15:16:43,145 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 99 [2018-04-11 15:16:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:43,145 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-04-11 15:16:43,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:16:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-04-11 15:16:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-11 15:16:43,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:43,146 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:43,146 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:43,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1290073616, now seen corresponding path program 17 times [2018-04-11 15:16:43,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:43,146 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:43,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:43,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:43,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:43,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:43,196 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:43,196 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:43,196 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:43,197 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:16:43,357 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-11 15:16:43,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:43,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:43,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:43,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:43,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:43,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:43,403 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-11 15:16:43,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:43,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:43,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:43,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:43,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:43,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:43,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:43,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:43,440 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-11 15:16:43,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:16:43,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:16:43,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:43,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:43,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-11 15:16:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:43,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:43,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:16:43,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:16:43,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:16:43,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:16:43,896 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 28 states. [2018-04-11 15:16:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:45,018 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-04-11 15:16:45,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:16:45,018 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2018-04-11 15:16:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:45,019 INFO L225 Difference]: With dead ends: 112 [2018-04-11 15:16:45,019 INFO L226 Difference]: Without dead ends: 112 [2018-04-11 15:16:45,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=2486, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:16:45,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-11 15:16:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-04-11 15:16:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-11 15:16:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-04-11 15:16:45,021 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 104 [2018-04-11 15:16:45,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:45,021 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-04-11 15:16:45,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:16:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-04-11 15:16:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-11 15:16:45,022 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:45,022 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:45,022 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:45,022 INFO L82 PathProgramCache]: Analyzing trace with hash -91718657, now seen corresponding path program 18 times [2018-04-11 15:16:45,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:45,022 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:45,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:45,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:45,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:45,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:45,083 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:45,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:45,083 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:45,084 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:16:45,328 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-11 15:16:45,328 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:45,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:45,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:45,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:45,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:45,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:45,375 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-11 15:16:45,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:45,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:45,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:45,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:45,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:45,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:45,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:45,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:45,407 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-11 15:16:45,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:16:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:45,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:45,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:16:45,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:16:45,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:16:45,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:16:45,918 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 29 states. [2018-04-11 15:16:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:47,139 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-04-11 15:16:47,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:16:47,139 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2018-04-11 15:16:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:47,140 INFO L225 Difference]: With dead ends: 117 [2018-04-11 15:16:47,140 INFO L226 Difference]: Without dead ends: 117 [2018-04-11 15:16:47,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=2690, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 15:16:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-11 15:16:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-04-11 15:16:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 15:16:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-04-11 15:16:47,142 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 109 [2018-04-11 15:16:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:47,142 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-04-11 15:16:47,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:16:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-04-11 15:16:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-11 15:16:47,143 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:47,143 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:47,143 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:47,143 INFO L82 PathProgramCache]: Analyzing trace with hash -246744240, now seen corresponding path program 19 times [2018-04-11 15:16:47,143 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:47,143 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:47,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:47,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:47,144 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:47,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:47,313 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:47,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:47,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:47,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:47,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:47,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:47,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:47,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:47,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:47,487 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-11 15:16:47,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:47,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:47,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:47,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:47,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:47,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:47,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:47,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:47,521 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-11 15:16:47,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:16:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:48,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:48,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:16:48,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:16:48,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:16:48,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:16:48,061 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 31 states. [2018-04-11 15:16:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:49,254 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-04-11 15:16:49,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:16:49,254 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 114 [2018-04-11 15:16:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:49,255 INFO L225 Difference]: With dead ends: 122 [2018-04-11 15:16:49,255 INFO L226 Difference]: Without dead ends: 122 [2018-04-11 15:16:49,255 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=3119, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:16:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-11 15:16:49,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-04-11 15:16:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-11 15:16:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-04-11 15:16:49,257 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 114 [2018-04-11 15:16:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:49,257 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-04-11 15:16:49,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:16:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-04-11 15:16:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-11 15:16:49,258 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:49,258 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:49,258 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:49,258 INFO L82 PathProgramCache]: Analyzing trace with hash 628647583, now seen corresponding path program 20 times [2018-04-11 15:16:49,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:49,258 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:49,259 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:49,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:49,259 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:49,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:49,356 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:49,356 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:49,356 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:49,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:16:49,496 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:16:49,496 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:49,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:49,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:49,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:49,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:49,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:49,530 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-11 15:16:49,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:49,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:49,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:49,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:49,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:49,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:49,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:49,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:49,556 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-11 15:16:49,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:16:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:50,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:50,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 15:16:50,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:16:50,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:16:50,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:16:50,041 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 32 states. [2018-04-11 15:16:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:51,362 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-04-11 15:16:51,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:16:51,363 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 119 [2018-04-11 15:16:51,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:51,363 INFO L225 Difference]: With dead ends: 127 [2018-04-11 15:16:51,363 INFO L226 Difference]: Without dead ends: 127 [2018-04-11 15:16:51,364 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=3347, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 15:16:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-11 15:16:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-04-11 15:16:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 15:16:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-04-11 15:16:51,366 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 119 [2018-04-11 15:16:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:51,366 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-04-11 15:16:51,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:16:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-04-11 15:16:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-11 15:16:51,367 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:51,367 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:51,367 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:51,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1564166992, now seen corresponding path program 21 times [2018-04-11 15:16:51,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:51,368 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:51,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:51,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:51,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:51,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:51,416 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:51,416 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:51,416 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:51,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:16:51,606 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-11 15:16:51,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:51,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:51,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:51,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:51,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:51,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:16:51,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:16:51,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:51,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:51,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:16:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:52,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:52,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-11 15:16:52,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 15:16:52,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 15:16:52,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:16:52,111 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 33 states. [2018-04-11 15:16:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:53,353 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-04-11 15:16:53,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 15:16:53,353 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2018-04-11 15:16:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:53,354 INFO L225 Difference]: With dead ends: 132 [2018-04-11 15:16:53,354 INFO L226 Difference]: Without dead ends: 132 [2018-04-11 15:16:53,355 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=3583, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 15:16:53,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-11 15:16:53,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-04-11 15:16:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-11 15:16:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-04-11 15:16:53,356 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 124 [2018-04-11 15:16:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:53,356 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-04-11 15:16:53,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 15:16:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-04-11 15:16:53,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-11 15:16:53,357 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:53,357 INFO L355 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:53,357 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:53,357 INFO L82 PathProgramCache]: Analyzing trace with hash -872707777, now seen corresponding path program 22 times [2018-04-11 15:16:53,357 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:53,357 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:53,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:53,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:53,358 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:53,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:53,381 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:53,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:53,382 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:53,382 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:16:53,547 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:16:53,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:53,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:53,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:53,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:53,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:53,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:16:53,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:16:53,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:53,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:53,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:16:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:54,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:54,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-11 15:16:54,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 15:16:54,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 15:16:54,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:16:54,159 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 33 states. [2018-04-11 15:16:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:55,539 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-04-11 15:16:55,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 15:16:55,539 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 129 [2018-04-11 15:16:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:55,540 INFO L225 Difference]: With dead ends: 137 [2018-04-11 15:16:55,540 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 15:16:55,541 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=196, Invalid=3586, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 15:16:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 15:16:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-04-11 15:16:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-11 15:16:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-04-11 15:16:55,543 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 129 [2018-04-11 15:16:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:55,543 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-04-11 15:16:55,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 15:16:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-04-11 15:16:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-04-11 15:16:55,544 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:55,544 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:55,544 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:55,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1410451952, now seen corresponding path program 23 times [2018-04-11 15:16:55,545 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:55,545 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:55,545 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:55,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:55,545 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:55,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:55,634 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:55,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:55,634 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:55,635 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:16:55,852 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-11 15:16:55,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:55,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:55,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:55,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:55,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:55,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:16:55,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:16:55,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:55,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:55,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:16:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:56,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:56,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 15:16:56,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 15:16:56,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 15:16:56,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:16:56,423 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 34 states. [2018-04-11 15:16:57,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:57,907 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-04-11 15:16:57,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 15:16:57,907 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 134 [2018-04-11 15:16:57,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:57,908 INFO L225 Difference]: With dead ends: 142 [2018-04-11 15:16:57,908 INFO L226 Difference]: Without dead ends: 142 [2018-04-11 15:16:57,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=202, Invalid=3830, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 15:16:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-11 15:16:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-04-11 15:16:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-11 15:16:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-04-11 15:16:57,910 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 134 [2018-04-11 15:16:57,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:57,911 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-04-11 15:16:57,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 15:16:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-04-11 15:16:57,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-04-11 15:16:57,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:57,911 INFO L355 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:57,911 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:16:57,911 INFO L82 PathProgramCache]: Analyzing trace with hash -647240737, now seen corresponding path program 24 times [2018-04-11 15:16:57,911 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:57,911 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:57,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:57,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:57,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:57,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:57,975 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:57,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:57,975 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:57,976 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:16:58,236 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-11 15:16:58,236 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:58,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:58,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:58,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:58,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:58,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:58,261 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-11 15:16:58,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:16:58,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:58,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:58,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:58,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:58,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:58,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:58,286 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-11 15:16:58,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:16:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:58,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:58,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-11 15:16:58,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 15:16:58,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 15:16:58,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:16:58,953 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 35 states. [2018-04-11 15:17:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:00,572 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-04-11 15:17:00,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 15:17:00,572 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-04-11 15:17:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:00,573 INFO L225 Difference]: With dead ends: 147 [2018-04-11 15:17:00,573 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 15:17:00,573 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=208, Invalid=4082, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 15:17:00,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 15:17:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-04-11 15:17:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-11 15:17:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-04-11 15:17:00,575 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 139 [2018-04-11 15:17:00,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:00,575 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-04-11 15:17:00,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 15:17:00,575 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-04-11 15:17:00,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-04-11 15:17:00,576 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:00,576 INFO L355 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:00,576 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:00,576 INFO L82 PathProgramCache]: Analyzing trace with hash 699236208, now seen corresponding path program 25 times [2018-04-11 15:17:00,576 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:00,576 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:00,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:00,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:17:00,577 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:00,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:00,779 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:00,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:00,779 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:00,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:17:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:00,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:00,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:00,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:00,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:00,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:00,983 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-11 15:17:00,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:17:00,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:01,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:17:01,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:01,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:01,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:01,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:17:01,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:01,021 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-11 15:17:01,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:17:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:01,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:01,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-11 15:17:01,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 15:17:01,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 15:17:01,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:17:01,677 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 37 states. [2018-04-11 15:17:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:03,711 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-04-11 15:17:03,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:17:03,711 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 144 [2018-04-11 15:17:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:03,712 INFO L225 Difference]: With dead ends: 152 [2018-04-11 15:17:03,712 INFO L226 Difference]: Without dead ends: 152 [2018-04-11 15:17:03,712 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=223, Invalid=4607, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 15:17:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-11 15:17:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-04-11 15:17:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-11 15:17:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-04-11 15:17:03,714 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 144 [2018-04-11 15:17:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:03,715 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-04-11 15:17:03,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 15:17:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-04-11 15:17:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-04-11 15:17:03,715 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:03,715 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:03,715 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:03,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1352889983, now seen corresponding path program 26 times [2018-04-11 15:17:03,715 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:03,715 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:03,716 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:03,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:17:03,716 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:03,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:03,797 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:03,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:03,798 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:03,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:17:04,083 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:17:04,083 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:04,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:04,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:04,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:04,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-11 15:17:04,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:04,104 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-11 15:17:04,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:17:04,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:04,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:17:04,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:04,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:04,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:04,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:17:04,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:04,124 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-11 15:17:04,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:17:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:04,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:04,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-11 15:17:04,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 15:17:04,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 15:17:04,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:17:04,892 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 38 states. [2018-04-11 15:17:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:06,846 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-04-11 15:17:06,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 15:17:06,846 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 149 [2018-04-11 15:17:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:06,847 INFO L225 Difference]: With dead ends: 157 [2018-04-11 15:17:06,847 INFO L226 Difference]: Without dead ends: 157 [2018-04-11 15:17:06,847 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=229, Invalid=4883, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 15:17:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-11 15:17:06,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-04-11 15:17:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 15:17:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-04-11 15:17:06,849 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 149 [2018-04-11 15:17:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:06,849 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-04-11 15:17:06,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 15:17:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-04-11 15:17:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-04-11 15:17:06,849 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:06,849 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:06,850 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:06,850 INFO L82 PathProgramCache]: Analyzing trace with hash -781676336, now seen corresponding path program 27 times [2018-04-11 15:17:06,850 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:06,850 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:06,850 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:06,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:17:06,850 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:06,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:06,886 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:06,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:06,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:06,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:17:07,189 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-11 15:17:07,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:07,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:07,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:07,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:07,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:07,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:17:07,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:17:07,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:17:07,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:07,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:17:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:08,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:08,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-11 15:17:08,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 15:17:08,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 15:17:08,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1479, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:17:08,021 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 40 states. [2018-04-11 15:17:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:09,903 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-04-11 15:17:09,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 15:17:09,903 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 154 [2018-04-11 15:17:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:09,904 INFO L225 Difference]: With dead ends: 162 [2018-04-11 15:17:09,904 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 15:17:09,905 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=247, Invalid=5453, Unknown=0, NotChecked=0, Total=5700 [2018-04-11 15:17:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 15:17:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-04-11 15:17:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-11 15:17:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-04-11 15:17:09,908 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 154 [2018-04-11 15:17:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:09,908 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-04-11 15:17:09,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 15:17:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-04-11 15:17:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-04-11 15:17:09,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:09,909 INFO L355 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:09,909 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:09,909 INFO L82 PathProgramCache]: Analyzing trace with hash -335789793, now seen corresponding path program 28 times [2018-04-11 15:17:09,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:09,909 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:09,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:09,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:17:09,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:09,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:10,142 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:10,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:10,142 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:10,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:17:10,376 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:17:10,376 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:10,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:10,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:10,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:10,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:10,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:10,447 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-11 15:17:10,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:17:10,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:10,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:17:10,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:10,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:10,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:10,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:17:10,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:10,492 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-11 15:17:10,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-11 15:17:11,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:17:11,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:11,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:11,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-04-11 15:17:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:11,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:11,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-11 15:17:11,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 15:17:11,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 15:17:11,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:17:11,479 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 40 states. [2018-04-11 15:17:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:14,145 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-04-11 15:17:14,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 15:17:14,145 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2018-04-11 15:17:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:14,146 INFO L225 Difference]: With dead ends: 167 [2018-04-11 15:17:14,146 INFO L226 Difference]: Without dead ends: 167 [2018-04-11 15:17:14,147 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=236, Invalid=5314, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 15:17:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-11 15:17:14,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-04-11 15:17:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-11 15:17:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-04-11 15:17:14,149 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 159 [2018-04-11 15:17:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:14,150 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-04-11 15:17:14,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 15:17:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-04-11 15:17:14,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-04-11 15:17:14,151 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:14,151 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:14,151 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:14,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1359309360, now seen corresponding path program 29 times [2018-04-11 15:17:14,151 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:14,151 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:14,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:14,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:17:14,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:14,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:14,381 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:14,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:14,381 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:14,382 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:17:14,680 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-11 15:17:14,680 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:14,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:14,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:14,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:14,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:14,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:14,708 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-11 15:17:14,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:17:14,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:14,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:17:14,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:14,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:14,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:14,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:17:14,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:14,734 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-11 15:17:14,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-11 15:17:14,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:17:14,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:14,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:14,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-11 15:17:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:15,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:15,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-11 15:17:15,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 15:17:15,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 15:17:15,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:17:15,565 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 40 states. [2018-04-11 15:17:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:17,992 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-04-11 15:17:17,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 15:17:17,992 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 164 [2018-04-11 15:17:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:17,993 INFO L225 Difference]: With dead ends: 172 [2018-04-11 15:17:17,993 INFO L226 Difference]: Without dead ends: 172 [2018-04-11 15:17:17,993 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=233, Invalid=5317, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 15:17:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-11 15:17:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-04-11 15:17:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-11 15:17:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-04-11 15:17:17,996 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 164 [2018-04-11 15:17:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:17,996 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-04-11 15:17:17,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 15:17:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-04-11 15:17:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-04-11 15:17:17,997 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:17,997 INFO L355 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:17,997 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:17,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1118813249, now seen corresponding path program 30 times [2018-04-11 15:17:17,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:17,997 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:17,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:17,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:17:17,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:18,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:18,247 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:18,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:18,247 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:18,248 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:17:18,710 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-11 15:17:18,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:18,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:18,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:18,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:18,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:18,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:18,764 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-11 15:17:18,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:17:18,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:18,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:18,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:17:18,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:18,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:17:18,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:18,785 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-11 15:17:18,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:17:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:19,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:19,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-11 15:17:19,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-11 15:17:19,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-11 15:17:19,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1719, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 15:17:19,662 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 43 states. [2018-04-11 15:17:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:22,112 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-04-11 15:17:22,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-11 15:17:22,113 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 169 [2018-04-11 15:17:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:22,113 INFO L225 Difference]: With dead ends: 177 [2018-04-11 15:17:22,113 INFO L226 Difference]: Without dead ends: 177 [2018-04-11 15:17:22,114 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=265, Invalid=6377, Unknown=0, NotChecked=0, Total=6642 [2018-04-11 15:17:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-11 15:17:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-04-11 15:17:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-11 15:17:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-04-11 15:17:22,117 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 169 [2018-04-11 15:17:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:22,117 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-04-11 15:17:22,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-11 15:17:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-04-11 15:17:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-04-11 15:17:22,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:22,118 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:22,118 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:22,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1360393328, now seen corresponding path program 31 times [2018-04-11 15:17:22,118 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:22,118 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:22,118 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:22,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:17:22,118 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:22,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:22,290 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:22,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:22,290 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:22,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:17:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:22,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:22,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:22,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:22,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:22,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:22,682 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-11 15:17:22,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:17:22,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:22,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:17:22,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:22,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:22,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:22,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:17:22,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:22,707 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-11 15:17:22,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:17:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:23,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:23,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-11 15:17:23,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-11 15:17:23,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-11 15:17:23,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 15:17:23,536 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 43 states. [2018-04-11 15:17:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:25,973 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-04-11 15:17:25,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-11 15:17:25,973 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 174 [2018-04-11 15:17:25,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:25,974 INFO L225 Difference]: With dead ends: 182 [2018-04-11 15:17:25,974 INFO L226 Difference]: Without dead ends: 182 [2018-04-11 15:17:25,975 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=259, Invalid=6383, Unknown=0, NotChecked=0, Total=6642 [2018-04-11 15:17:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-11 15:17:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-04-11 15:17:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 15:17:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-04-11 15:17:25,978 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 174 [2018-04-11 15:17:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:25,978 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-04-11 15:17:25,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-11 15:17:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-04-11 15:17:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-04-11 15:17:25,979 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:25,979 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:25,979 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:25,979 INFO L82 PathProgramCache]: Analyzing trace with hash -839287201, now seen corresponding path program 32 times [2018-04-11 15:17:25,979 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:25,979 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:25,980 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:25,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:17:25,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:26,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:26,279 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:26,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:26,279 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:26,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:17:26,727 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:17:26,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:26,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:26,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:26,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:26,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:26,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:26,767 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-11 15:17:26,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:17:26,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:26,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:17:26,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:26,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:26,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:26,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:17:26,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:26,794 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-11 15:17:26,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:25 [2018-04-11 15:17:27,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:17:27,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:27,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:27,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-04-11 15:17:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:28,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:28,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-11 15:17:28,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 15:17:28,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 15:17:28,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1889, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:17:28,010 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 45 states. [2018-04-11 15:17:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:31,182 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-04-11 15:17:31,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 15:17:31,182 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 179 [2018-04-11 15:17:31,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:31,183 INFO L225 Difference]: With dead ends: 187 [2018-04-11 15:17:31,183 INFO L226 Difference]: Without dead ends: 187 [2018-04-11 15:17:31,183 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=272, Invalid=6868, Unknown=0, NotChecked=0, Total=7140 [2018-04-11 15:17:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-11 15:17:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-04-11 15:17:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 15:17:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-04-11 15:17:31,185 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 179 [2018-04-11 15:17:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:31,185 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-04-11 15:17:31,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 15:17:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-04-11 15:17:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-11 15:17:31,186 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:31,186 INFO L355 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:31,186 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:31,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1443072784, now seen corresponding path program 33 times [2018-04-11 15:17:31,186 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:31,186 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:31,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:31,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:17:31,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:31,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:31,627 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:31,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:31,627 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:31,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:17:31,945 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-11 15:17:31,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:31,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:31,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:31,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:31,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:31,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:17:31,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:17:31,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:17:32,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:32,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:17:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:32,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:32,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-11 15:17:32,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-11 15:17:32,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-11 15:17:32,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1977, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:17:32,914 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 46 states. [2018-04-11 15:17:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:35,300 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-04-11 15:17:35,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 15:17:35,300 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 184 [2018-04-11 15:17:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:35,301 INFO L225 Difference]: With dead ends: 192 [2018-04-11 15:17:35,301 INFO L226 Difference]: Without dead ends: 192 [2018-04-11 15:17:35,301 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=283, Invalid=7373, Unknown=0, NotChecked=0, Total=7656 [2018-04-11 15:17:35,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-04-11 15:17:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2018-04-11 15:17:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-11 15:17:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-04-11 15:17:35,303 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 184 [2018-04-11 15:17:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:35,303 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-04-11 15:17:35,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-11 15:17:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-04-11 15:17:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-04-11 15:17:35,304 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:35,304 INFO L355 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:35,304 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:35,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1093537537, now seen corresponding path program 34 times [2018-04-11 15:17:35,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:35,304 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:35,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:35,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:17:35,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:35,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:35,546 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:35,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:35,546 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:35,547 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:17:35,874 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:17:35,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:35,904 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:35,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:35,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:35,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:35,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:35,914 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-11 15:17:35,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:17:35,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:35,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-11 15:17:35,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:35,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:35,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:35,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:17:35,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:35,936 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-11 15:17:35,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:17:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:37,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:37,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-11 15:17:37,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-11 15:17:37,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-11 15:17:37,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:17:37,013 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 46 states. [2018-04-11 15:17:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:39,911 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-04-11 15:17:39,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 15:17:39,912 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 189 [2018-04-11 15:17:39,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:39,912 INFO L225 Difference]: With dead ends: 197 [2018-04-11 15:17:39,912 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 15:17:39,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=277, Invalid=7379, Unknown=0, NotChecked=0, Total=7656 [2018-04-11 15:17:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 15:17:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-04-11 15:17:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-11 15:17:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-04-11 15:17:39,915 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 189 [2018-04-11 15:17:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:39,915 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-04-11 15:17:39,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-11 15:17:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-04-11 15:17:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-04-11 15:17:39,916 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:39,916 INFO L355 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:39,916 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:39,917 INFO L82 PathProgramCache]: Analyzing trace with hash 430089808, now seen corresponding path program 35 times [2018-04-11 15:17:39,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:39,917 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:39,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:39,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:17:39,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:39,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:40,304 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:40,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:40,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:40,305 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:17:40,778 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-11 15:17:40,779 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:40,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:40,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:40,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:40,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:40,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:40,823 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-11 15:17:40,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:17:40,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:40,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:17:40,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:40,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:40,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:40,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:17:40,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:40,848 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-11 15:17:40,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:17:41,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:17:41,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:41,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:41,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-11 15:17:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:41,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:41,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-11 15:17:41,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 15:17:41,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 15:17:41,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:17:41,759 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 45 states. [2018-04-11 15:17:44,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:44,697 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-04-11 15:17:44,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-11 15:17:44,698 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 194 [2018-04-11 15:17:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:44,698 INFO L225 Difference]: With dead ends: 202 [2018-04-11 15:17:44,698 INFO L226 Difference]: Without dead ends: 202 [2018-04-11 15:17:44,699 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=265, Invalid=7045, Unknown=0, NotChecked=0, Total=7310 [2018-04-11 15:17:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-11 15:17:44,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-04-11 15:17:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 15:17:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-04-11 15:17:44,701 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 194 [2018-04-11 15:17:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:44,701 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-04-11 15:17:44,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 15:17:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-04-11 15:17:44,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-04-11 15:17:44,702 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:44,702 INFO L355 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:44,702 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:44,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1748212639, now seen corresponding path program 36 times [2018-04-11 15:17:44,702 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:44,702 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:44,702 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:44,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:17:44,702 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:44,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:44,910 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:44,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:44,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:44,910 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:17:45,374 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-11 15:17:45,374 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:45,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:45,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:45,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:45,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:45,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:45,416 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-11 15:17:45,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:17:45,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:45,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:17:45,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:45,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:45,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:45,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:17:45,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:45,436 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-11 15:17:45,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:17:46,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:17:46,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:46,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:46,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-11 15:17:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:46,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:46,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-11 15:17:46,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-11 15:17:46,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-11 15:17:46,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2254, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:17:46,715 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 49 states. [2018-04-11 15:17:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:50,031 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-04-11 15:17:50,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 15:17:50,059 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 199 [2018-04-11 15:17:50,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:50,059 INFO L225 Difference]: With dead ends: 207 [2018-04-11 15:17:50,059 INFO L226 Difference]: Without dead ends: 207 [2018-04-11 15:17:50,060 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=293, Invalid=8263, Unknown=0, NotChecked=0, Total=8556 [2018-04-11 15:17:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-11 15:17:50,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-04-11 15:17:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 15:17:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-04-11 15:17:50,061 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 199 [2018-04-11 15:17:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:50,062 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-04-11 15:17:50,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-11 15:17:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-04-11 15:17:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-04-11 15:17:50,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:50,062 INFO L355 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:50,062 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:50,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1304600496, now seen corresponding path program 37 times [2018-04-11 15:17:50,063 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:50,063 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:50,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:50,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:17:50,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:50,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:50,308 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:50,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:50,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:50,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:17:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:50,874 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:50,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:50,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:50,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:50,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:50,894 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-11 15:17:50,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:17:50,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:50,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:50,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:17:50,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:50,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:17:50,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:50,912 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-11 15:17:50,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:17:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:52,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:52,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-11 15:17:52,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-11 15:17:52,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-11 15:17:52,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:17:52,005 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 49 states. [2018-04-11 15:17:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:55,134 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-04-11 15:17:55,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-11 15:17:55,135 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 204 [2018-04-11 15:17:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:55,135 INFO L225 Difference]: With dead ends: 212 [2018-04-11 15:17:55,135 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 15:17:55,136 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=295, Invalid=8447, Unknown=0, NotChecked=0, Total=8742 [2018-04-11 15:17:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 15:17:55,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-04-11 15:17:55,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 15:17:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-04-11 15:17:55,138 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 204 [2018-04-11 15:17:55,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:55,138 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-04-11 15:17:55,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-11 15:17:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-04-11 15:17:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-04-11 15:17:55,139 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:55,139 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:55,139 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:17:55,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2046328383, now seen corresponding path program 38 times [2018-04-11 15:17:55,139 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:55,139 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:55,139 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:55,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:17:55,139 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:55,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:55,489 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:55,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:55,489 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:55,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:17:56,200 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:17:56,200 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:56,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:56,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:56,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:56,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:56,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:17:56,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:17:56,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:17:56,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:56,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:17:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:57,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:57,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-11 15:17:57,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-11 15:17:57,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-11 15:17:57,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:17:57,253 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 50 states. [2018-04-11 15:18:00,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:18:00,307 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-04-11 15:18:00,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 15:18:00,307 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 209 [2018-04-11 15:18:00,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:18:00,308 INFO L225 Difference]: With dead ends: 217 [2018-04-11 15:18:00,308 INFO L226 Difference]: Without dead ends: 217 [2018-04-11 15:18:00,308 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=301, Invalid=8819, Unknown=0, NotChecked=0, Total=9120 [2018-04-11 15:18:00,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-11 15:18:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-04-11 15:18:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-11 15:18:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-04-11 15:18:00,310 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 209 [2018-04-11 15:18:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:18:00,310 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-04-11 15:18:00,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-11 15:18:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-04-11 15:18:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-04-11 15:18:00,311 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:18:00,311 INFO L355 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:18:00,311 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:18:00,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1858232592, now seen corresponding path program 39 times [2018-04-11 15:18:00,311 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:18:00,311 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:18:00,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:00,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:18:00,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:18:00,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:18:00,552 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:18:00,552 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:18:00,552 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:18:00,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:18:01,134 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-11 15:18:01,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:18:01,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:18:01,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:01,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:01,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:01,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:01,170 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-11 15:18:01,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:18:01,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:01,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:18:01,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:01,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:01,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:01,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:18:01,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:01,193 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-11 15:18:01,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:18:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:18:02,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:18:02,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-11 15:18:02,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-11 15:18:02,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-11 15:18:02,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:18:02,608 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 50 states. [2018-04-11 15:18:06,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:18:06,022 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-04-11 15:18:06,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 15:18:06,022 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 214 [2018-04-11 15:18:06,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:18:06,023 INFO L225 Difference]: With dead ends: 222 [2018-04-11 15:18:06,023 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 15:18:06,024 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=298, Invalid=8822, Unknown=0, NotChecked=0, Total=9120 [2018-04-11 15:18:06,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 15:18:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-04-11 15:18:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 15:18:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-04-11 15:18:06,026 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 214 [2018-04-11 15:18:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:18:06,026 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-04-11 15:18:06,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-11 15:18:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-04-11 15:18:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-04-11 15:18:06,027 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:18:06,027 INFO L355 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:18:06,027 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:18:06,027 INFO L82 PathProgramCache]: Analyzing trace with hash 461019359, now seen corresponding path program 40 times [2018-04-11 15:18:06,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:18:06,027 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:18:06,027 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:06,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:18:06,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:18:06,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:18:06,151 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:18:06,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:18:06,152 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:18:06,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:18:06,602 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:18:06,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:18:06,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:18:06,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:06,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:06,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:06,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:06,646 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-11 15:18:06,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:18:06,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:06,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:18:06,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:06,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:06,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:06,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:18:06,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:06,666 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-11 15:18:06,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:18:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:18:07,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:18:07,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-11 15:18:07,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-11 15:18:07,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-11 15:18:07,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2549, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:18:07,901 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 52 states. [2018-04-11 15:18:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:18:11,562 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-04-11 15:18:11,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 15:18:11,562 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 219 [2018-04-11 15:18:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:18:11,562 INFO L225 Difference]: With dead ends: 227 [2018-04-11 15:18:11,562 INFO L226 Difference]: Without dead ends: 227 [2018-04-11 15:18:11,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=313, Invalid=9587, Unknown=0, NotChecked=0, Total=9900 [2018-04-11 15:18:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-11 15:18:11,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-04-11 15:18:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-11 15:18:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-04-11 15:18:11,565 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 219 [2018-04-11 15:18:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:18:11,565 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-04-11 15:18:11,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-11 15:18:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-04-11 15:18:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-04-11 15:18:11,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:18:11,565 INFO L355 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:18:11,566 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:18:11,566 INFO L82 PathProgramCache]: Analyzing trace with hash -578295184, now seen corresponding path program 41 times [2018-04-11 15:18:11,566 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:18:11,566 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:18:11,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:11,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:18:11,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:18:11,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:18:11,768 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:18:11,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:18:11,768 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:18:11,769 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:18:12,870 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-11 15:18:12,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:18:12,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:18:12,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:12,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:12,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:12,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:12,911 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-11 15:18:12,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:18:12,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:12,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:12,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:18:12,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:12,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:18:12,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:12,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:18:12,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-11 15:18:13,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:18:13,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:13,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:18:13,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-04-11 15:18:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:18:14,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:18:14,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-11 15:18:14,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-11 15:18:14,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-11 15:18:14,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2754, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 15:18:14,501 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 54 states. [2018-04-11 15:18:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:18:19,065 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-04-11 15:18:19,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-11 15:18:19,065 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 224 [2018-04-11 15:18:19,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:18:19,066 INFO L225 Difference]: With dead ends: 232 [2018-04-11 15:18:19,066 INFO L226 Difference]: Without dead ends: 232 [2018-04-11 15:18:19,067 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=323, Invalid=10183, Unknown=0, NotChecked=0, Total=10506 [2018-04-11 15:18:19,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-11 15:18:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-04-11 15:18:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-11 15:18:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-04-11 15:18:19,068 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 224 [2018-04-11 15:18:19,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:18:19,068 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-04-11 15:18:19,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-11 15:18:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-04-11 15:18:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-04-11 15:18:19,069 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:18:19,069 INFO L355 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:18:19,069 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:18:19,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1953240193, now seen corresponding path program 42 times [2018-04-11 15:18:19,069 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:18:19,069 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:18:19,070 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:19,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:18:19,070 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:18:19,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:18:19,597 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:18:19,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:18:19,597 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:18:19,597 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:18:20,433 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-11 15:18:20,433 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:18:20,466 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:18:20,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-11 15:18:20,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:20,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:20,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:20,476 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-11 15:18:20,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:18:20,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:20,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:18:20,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:20,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:20,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:20,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:18:20,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:20,506 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-11 15:18:20,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:18:21,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:18:21,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:21,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:18:21,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2018-04-11 15:18:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:18:22,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:18:22,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-11 15:18:22,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-11 15:18:22,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-11 15:18:22,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2860, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 15:18:22,111 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 55 states. [2018-04-11 15:18:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:18:26,488 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-04-11 15:18:26,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-11 15:18:26,488 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 229 [2018-04-11 15:18:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:18:26,489 INFO L225 Difference]: With dead ends: 237 [2018-04-11 15:18:26,489 INFO L226 Difference]: Without dead ends: 237 [2018-04-11 15:18:26,490 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=334, Invalid=10796, Unknown=0, NotChecked=0, Total=11130 [2018-04-11 15:18:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-11 15:18:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2018-04-11 15:18:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-11 15:18:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-04-11 15:18:26,491 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 229 [2018-04-11 15:18:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:18:26,492 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-04-11 15:18:26,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-11 15:18:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-04-11 15:18:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-04-11 15:18:26,492 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:18:26,492 INFO L355 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:18:26,492 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:18:26,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1820771376, now seen corresponding path program 43 times [2018-04-11 15:18:26,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:18:26,493 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:18:26,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:26,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:18:26,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:18:26,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:18:27,079 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:18:27,079 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:18:27,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:18:27,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:18:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:18:27,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:18:27,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:27,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:27,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:27,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:27,967 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-11 15:18:27,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:18:27,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:27,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:18:27,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:27,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:27,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:27,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:18:27,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:27,989 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-11 15:18:27,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:18:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:18:29,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:18:29,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-11 15:18:29,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-11 15:18:29,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-11 15:18:29,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 15:18:29,332 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 55 states. [2018-04-11 15:18:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:18:33,358 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-04-11 15:18:33,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-11 15:18:33,358 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 234 [2018-04-11 15:18:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:18:33,359 INFO L225 Difference]: With dead ends: 242 [2018-04-11 15:18:33,359 INFO L226 Difference]: Without dead ends: 242 [2018-04-11 15:18:33,359 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=331, Invalid=10799, Unknown=0, NotChecked=0, Total=11130 [2018-04-11 15:18:33,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-11 15:18:33,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-04-11 15:18:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-04-11 15:18:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-04-11 15:18:33,361 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 234 [2018-04-11 15:18:33,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:18:33,362 INFO L459 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-04-11 15:18:33,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-11 15:18:33,362 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-04-11 15:18:33,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-04-11 15:18:33,363 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:18:33,363 INFO L355 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:18:33,363 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:18:33,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1063356897, now seen corresponding path program 44 times [2018-04-11 15:18:33,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:18:33,363 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:18:33,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:33,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:18:33,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:18:33,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:18:33,865 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:18:33,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:18:33,865 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:18:33,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:18:34,762 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:18:34,762 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:18:34,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:18:34,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:34,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:34,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:34,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:34,813 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-11 15:18:34,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:18:34,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:34,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:34,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:18:34,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:34,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:18:34,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:34,834 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-11 15:18:34,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:18:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:18:36,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:18:36,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-11 15:18:36,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 15:18:36,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 15:18:36,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=2969, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 15:18:36,284 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 56 states. [2018-04-11 15:18:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:18:40,568 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-04-11 15:18:40,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-11 15:18:40,568 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 239 [2018-04-11 15:18:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:18:40,569 INFO L225 Difference]: With dead ends: 247 [2018-04-11 15:18:40,569 INFO L226 Difference]: Without dead ends: 247 [2018-04-11 15:18:40,569 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=337, Invalid=11219, Unknown=0, NotChecked=0, Total=11556 [2018-04-11 15:18:40,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-11 15:18:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-04-11 15:18:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-11 15:18:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-04-11 15:18:40,571 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 239 [2018-04-11 15:18:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:18:40,571 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-04-11 15:18:40,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 15:18:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-04-11 15:18:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-04-11 15:18:40,572 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:18:40,572 INFO L355 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:18:40,572 INFO L408 AbstractCegarLoop]: === Iteration 63 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:18:40,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2105780944, now seen corresponding path program 45 times [2018-04-11 15:18:40,572 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:18:40,572 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:18:40,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:40,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:18:40,573 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:18:40,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:18:40,963 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:18:40,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:18:40,963 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:18:40,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:18:41,594 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-11 15:18:41,594 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:18:41,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:18:41,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:41,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:41,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:18:41,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:18:41,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:18:41,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:18:41,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:18:41,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:18:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:18:42,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:18:42,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-11 15:18:42,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 15:18:42,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 15:18:42,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 15:18:42,990 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 56 states. [2018-04-11 15:18:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:18:46,981 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-04-11 15:18:46,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-11 15:18:46,982 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 244 [2018-04-11 15:18:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:18:46,982 INFO L225 Difference]: With dead ends: 252 [2018-04-11 15:18:46,982 INFO L226 Difference]: Without dead ends: 252 [2018-04-11 15:18:46,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=334, Invalid=11222, Unknown=0, NotChecked=0, Total=11556 [2018-04-11 15:18:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-11 15:18:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2018-04-11 15:18:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-11 15:18:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-04-11 15:18:46,985 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 244 [2018-04-11 15:18:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:18:46,985 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-04-11 15:18:46,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 15:18:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-04-11 15:18:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-04-11 15:18:46,986 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:18:46,986 INFO L355 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:18:46,986 INFO L408 AbstractCegarLoop]: === Iteration 64 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:18:46,986 INFO L82 PathProgramCache]: Analyzing trace with hash 141834431, now seen corresponding path program 46 times [2018-04-11 15:18:46,986 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:18:46,986 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:18:46,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:46,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:18:46,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:18:47,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:18:47,515 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:18:47,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:18:47,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:18:47,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:18:48,564 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:18:48,622 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:18:48,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:18:48,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:48,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:48,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:48,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:48,706 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-11 15:18:48,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:18:48,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:48,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:48,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:18:48,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:48,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:18:48,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:48,725 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-11 15:18:48,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:18:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:18:50,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:18:50,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-11 15:18:50,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-11 15:18:50,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-11 15:18:50,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=3080, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 15:18:50,196 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 57 states. [2018-04-11 15:18:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:18:54,765 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-04-11 15:18:54,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-11 15:18:54,765 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 249 [2018-04-11 15:18:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:18:54,766 INFO L225 Difference]: With dead ends: 257 [2018-04-11 15:18:54,766 INFO L226 Difference]: Without dead ends: 257 [2018-04-11 15:18:54,767 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=340, Invalid=11650, Unknown=0, NotChecked=0, Total=11990 [2018-04-11 15:18:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-11 15:18:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-04-11 15:18:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-11 15:18:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-04-11 15:18:54,768 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 249 [2018-04-11 15:18:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:18:54,768 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-04-11 15:18:54,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-11 15:18:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-04-11 15:18:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-04-11 15:18:54,769 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:18:54,769 INFO L355 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:18:54,769 INFO L408 AbstractCegarLoop]: === Iteration 65 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:18:54,769 INFO L82 PathProgramCache]: Analyzing trace with hash -185125232, now seen corresponding path program 47 times [2018-04-11 15:18:54,769 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:18:54,769 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:18:54,770 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:54,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:18:54,770 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:18:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:18:54,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:18:55,105 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:18:55,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:18:55,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:18:55,106 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:18:56,235 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-11 15:18:56,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:18:56,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:18:56,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:56,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:56,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:18:56,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:56,320 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-11 15:18:56,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:18:56,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:56,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:18:56,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:18:56,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:56,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:18:56,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:56,341 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-11 15:18:56,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:18:56,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:18:56,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:18:56,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:18:56,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-11 15:18:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:18:57,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:18:57,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-11 15:18:57,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-11 15:18:57,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-11 15:18:57,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:18:57,839 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 58 states. [2018-04-11 15:19:02,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:02,466 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-04-11 15:19:02,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-11 15:19:02,466 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 254 [2018-04-11 15:19:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:02,467 INFO L225 Difference]: With dead ends: 262 [2018-04-11 15:19:02,467 INFO L226 Difference]: Without dead ends: 262 [2018-04-11 15:19:02,468 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=346, Invalid=12086, Unknown=0, NotChecked=0, Total=12432 [2018-04-11 15:19:02,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-11 15:19:02,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-04-11 15:19:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-11 15:19:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-04-11 15:19:02,469 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 254 [2018-04-11 15:19:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:02,469 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-04-11 15:19:02,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-11 15:19:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-04-11 15:19:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-04-11 15:19:02,470 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:02,470 INFO L355 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:02,470 INFO L408 AbstractCegarLoop]: === Iteration 66 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:02,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1469107361, now seen corresponding path program 48 times [2018-04-11 15:19:02,470 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:02,470 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:02,471 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:02,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:02,471 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:02,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:02,667 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:02,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:02,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:02,668 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:19:04,194 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-04-11 15:19:04,194 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:04,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:04,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:04,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:04,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:04,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:04,316 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-11 15:19:04,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:19:04,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:04,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:04,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:04,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:04,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:04,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:04,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:04,340 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-11 15:19:04,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:19:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:05,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:05,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-11 15:19:05,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-11 15:19:05,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-11 15:19:05,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:19:05,823 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 59 states. [2018-04-11 15:19:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:11,049 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-04-11 15:19:11,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-11 15:19:11,050 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 259 [2018-04-11 15:19:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:11,050 INFO L225 Difference]: With dead ends: 267 [2018-04-11 15:19:11,050 INFO L226 Difference]: Without dead ends: 267 [2018-04-11 15:19:11,051 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=352, Invalid=12530, Unknown=0, NotChecked=0, Total=12882 [2018-04-11 15:19:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-11 15:19:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-04-11 15:19:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-11 15:19:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-04-11 15:19:11,053 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 259 [2018-04-11 15:19:11,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:11,053 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-04-11 15:19:11,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-11 15:19:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-04-11 15:19:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-04-11 15:19:11,054 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:11,054 INFO L355 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:11,054 INFO L408 AbstractCegarLoop]: === Iteration 67 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:11,054 INFO L82 PathProgramCache]: Analyzing trace with hash -305143824, now seen corresponding path program 49 times [2018-04-11 15:19:11,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:11,054 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:11,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:11,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:11,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:11,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:11,452 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:11,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:11,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:11,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:11,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:11,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:11,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:11,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:11,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:11,859 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-11 15:19:11,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:19:11,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:11,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:11,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:11,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:11,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:11,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:11,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:11,880 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-11 15:19:11,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:19:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:13,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:13,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-11 15:19:13,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-11 15:19:13,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-11 15:19:13,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3539, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 15:19:13,673 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 61 states. Received shutdown request... [2018-04-11 15:19:16,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 15:19:16,656 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:19:16,660 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:19:16,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:19:16 BoogieIcfgContainer [2018-04-11 15:19:16,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:19:16,661 INFO L168 Benchmark]: Toolchain (without parser) took 175888.06 ms. Allocated memory was 400.6 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 333.0 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 631.4 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:16,662 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 400.6 MB. Free memory is still 359.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:19:16,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.61 ms. Allocated memory is still 400.6 MB. Free memory was 331.7 MB in the beginning and 307.8 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:16,662 INFO L168 Benchmark]: Boogie Preprocessor took 38.71 ms. Allocated memory is still 400.6 MB. Free memory was 307.8 MB in the beginning and 306.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:16,662 INFO L168 Benchmark]: RCFGBuilder took 336.15 ms. Allocated memory was 400.6 MB in the beginning and 610.8 MB in the end (delta: 210.2 MB). Free memory was 306.5 MB in the beginning and 547.7 MB in the end (delta: -241.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:16,663 INFO L168 Benchmark]: TraceAbstraction took 175274.27 ms. Allocated memory was 610.8 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 547.7 MB in the beginning and 1.6 GB in the end (delta: -1.0 GB). Peak memory consumption was 635.8 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:16,664 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 400.6 MB. Free memory is still 359.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 236.61 ms. Allocated memory is still 400.6 MB. Free memory was 331.7 MB in the beginning and 307.8 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.71 ms. Allocated memory is still 400.6 MB. Free memory was 307.8 MB in the beginning and 306.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 336.15 ms. Allocated memory was 400.6 MB in the beginning and 610.8 MB in the end (delta: 210.2 MB). Free memory was 306.5 MB in the beginning and 547.7 MB in the end (delta: -241.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 175274.27 ms. Allocated memory was 610.8 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 547.7 MB in the beginning and 1.6 GB in the end (delta: -1.0 GB). Peak memory consumption was 635.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 36 states, 61 states before enhancement), while ReachableStatesComputation was computing reachable states (149 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 36 states, 61 states before enhancement), while ReachableStatesComputation was computing reachable states (149 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 36 states, 61 states before enhancement), while ReachableStatesComputation was computing reachable states (149 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 36 states, 61 states before enhancement), while ReachableStatesComputation was computing reachable states (149 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 36 states, 61 states before enhancement), while ReachableStatesComputation was computing reachable states (149 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 36 states, 61 states before enhancement), while ReachableStatesComputation was computing reachable states (149 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 36 states, 61 states before enhancement), while ReachableStatesComputation was computing reachable states (149 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 46 locations, 7 error locations. TIMEOUT Result, 175.2s OverallTime, 67 OverallIterations, 50 TraceHistogramMax, 104.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3476 SDtfs, 7131 SDslu, 113260 SDs, 0 SdLazy, 164348 SolverSat, 1625 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8962 GetRequests, 5449 SyntacticMatches, 6 SemanticMatches, 3507 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 33017 ImplicationChecksByTransitivity, 79.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=66, 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, 66 MinimizatonAttempts, 337 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 18.5s SatisfiabilityAnalysisTime, 51.0s InterpolantComputationTime, 14734 NumberOfCodeBlocks, 14725 NumberOfCodeBlocksAsserted, 754 NumberOfCheckSat, 7387 ConstructedInterpolants, 81 QuantifiedInterpolants, 22047630 SizeOfPredicates, 648 NumberOfNonLiveVariables, 31482 ConjunctsInSsa, 9562 ConjunctsInUnsatCore, 68 InterpolantComputations, 14 PerfectInterpolantSequences, 15/101751 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/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-19-16-668.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-19-16-668.csv Completed graceful shutdown