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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8168ed2-m [2018-04-11 20:41:27,206 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 20:41:27,208 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 20:41:27,221 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 20:41:27,221 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 20:41:27,222 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 20:41:27,223 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 20:41:27,225 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 20:41:27,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 20:41:27,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 20:41:27,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 20:41:27,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 20:41:27,230 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 20:41:27,231 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 20:41:27,232 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 20:41:27,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 20:41:27,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 20:41:27,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 20:41:27,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 20:41:27,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 20:41:27,243 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 20:41:27,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 20:41:27,244 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 20:41:27,245 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 20:41:27,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 20:41:27,247 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 20:41:27,247 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 20:41:27,248 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 20:41:27,249 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 20:41:27,249 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 20:41:27,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 20:41:27,250 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-11 20:41:27,273 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 20:41:27,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 20:41:27,273 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-11 20:41:27,273 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-11 20:41:27,274 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-11 20:41:27,274 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-11 20:41:27,274 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-11 20:41:27,274 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-11 20:41:27,274 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-11 20:41:27,275 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-11 20:41:27,275 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-11 20:41:27,275 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-11 20:41:27,275 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 20:41:27,275 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 20:41:27,276 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 20:41:27,276 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 20:41:27,276 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 20:41:27,276 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 20:41:27,276 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 20:41:27,276 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-11 20:41:27,276 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 20:41:27,277 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 20:41:27,277 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 20:41:27,277 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-11 20:41:27,277 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-11 20:41:27,278 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 20:41:27,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 20:41:27,278 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 20:41:27,278 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 20:41:27,278 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 20:41:27,278 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-11 20:41:27,278 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-11 20:41:27,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:27,279 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-11 20:41:27,279 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-11 20:41:27,280 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-11 20:41:27,280 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-11 20:41:27,280 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-11 20:41:27,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 20:41:27,322 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 20:41:27,325 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 20:41:27,326 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 20:41:27,327 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 20:41:27,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,640 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe4b143a7a [2018-04-11 20:41:27,820 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 20:41:27,820 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 20:41:27,821 INFO L168 CDTParser]: Scanning openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,832 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 20:41:27,832 INFO L215 ultiparseSymbolTable]: [2018-04-11 20:41:27,833 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 20:41:27,833 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,833 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpy ('cstrlcpy') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,833 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,833 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,833 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 20:41:27,833 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,833 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,834 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,834 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,834 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,834 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,834 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,834 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,834 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,834 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:27,864 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe4b143a7a [2018-04-11 20:41:27,868 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 20:41:27,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 20:41:27,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 20:41:27,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 20:41:27,879 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 20:41:27,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 08:41:27" (1/1) ... [2018-04-11 20:41:27,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9dcd12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:41:27, skipping insertion in model container [2018-04-11 20:41:27,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 08:41:27" (1/1) ... [2018-04-11 20:41:27,897 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 20:41:27,927 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 20:41:28,119 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 20:41:28,171 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 20:41:28,178 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 20:41:28,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:41:28 WrapperNode [2018-04-11 20:41:28,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 20:41:28,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 20:41:28,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 20:41:28,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 20:41:28,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:41:28" (1/1) ... [2018-04-11 20:41:28,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:41:28" (1/1) ... [2018-04-11 20:41:28,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:41:28" (1/1) ... [2018-04-11 20:41:28,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:41:28" (1/1) ... [2018-04-11 20:41:28,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:41:28" (1/1) ... [2018-04-11 20:41:28,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:41:28" (1/1) ... [2018-04-11 20:41:28,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:41:28" (1/1) ... [2018-04-11 20:41:28,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 20:41:28,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 20:41:28,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 20:41:28,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 20:41:28,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:41:28" (1/1) ... No working directory specified, using /storage/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 20:41:28,419 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 20:41:28,419 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 20:41:28,419 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 20:41:28,420 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 20:41:28,420 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpy [2018-04-11 20:41:28,420 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 20:41:28,420 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 20:41:28,420 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 20:41:28,420 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 20:41:28,420 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 20:41:28,421 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 20:41:28,421 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 20:41:28,421 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 20:41:28,421 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 20:41:28,421 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 20:41:28,421 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 20:41:28,422 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 20:41:28,422 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 20:41:28,422 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 20:41:28,422 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 20:41:28,422 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 20:41:28,423 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 20:41:28,423 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 20:41:28,423 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 20:41:28,423 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 20:41:28,423 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 20:41:28,423 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 20:41:28,423 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 20:41:28,424 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 20:41:28,424 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 20:41:28,424 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 20:41:28,424 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 20:41:28,424 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 20:41:28,424 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 20:41:28,424 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 20:41:28,425 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 20:41:28,425 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 20:41:28,425 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 20:41:28,425 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 20:41:28,425 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 20:41:28,425 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 20:41:28,425 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 20:41:28,425 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 20:41:28,426 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 20:41:28,426 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 20:41:28,426 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 20:41:28,426 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 20:41:28,426 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 20:41:28,426 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 20:41:28,426 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 20:41:28,427 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 20:41:28,427 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 20:41:28,427 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 20:41:28,427 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 20:41:28,427 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 20:41:28,427 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 20:41:28,427 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 20:41:28,427 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 20:41:28,428 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 20:41:28,428 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 20:41:28,428 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 20:41:28,428 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 20:41:28,428 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 20:41:28,428 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 20:41:28,428 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 20:41:28,428 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 20:41:28,429 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 20:41:28,429 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 20:41:28,429 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 20:41:28,429 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 20:41:28,429 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 20:41:28,429 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 20:41:28,429 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 20:41:28,429 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 20:41:28,430 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 20:41:28,430 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 20:41:28,430 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 20:41:28,430 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 20:41:28,430 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 20:41:28,430 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 20:41:28,430 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 20:41:28,430 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 20:41:28,431 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 20:41:28,431 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 20:41:28,431 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 20:41:28,431 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 20:41:28,431 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 20:41:28,431 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 20:41:28,431 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 20:41:28,432 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 20:41:28,432 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 20:41:28,432 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 20:41:28,432 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 20:41:28,432 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 20:41:28,432 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 20:41:28,432 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 20:41:28,432 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 20:41:28,433 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 20:41:28,433 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 20:41:28,433 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 20:41:28,433 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 20:41:28,433 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 20:41:28,433 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 20:41:28,433 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 20:41:28,433 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 20:41:28,434 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 20:41:28,434 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 20:41:28,434 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 20:41:28,434 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 20:41:28,434 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpy [2018-04-11 20:41:28,434 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 20:41:28,434 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 20:41:28,434 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 20:41:28,435 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 20:41:28,435 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 20:41:28,435 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 20:41:28,435 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 20:41:28,435 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 20:41:28,803 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 20:41:28,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 08:41:28 BoogieIcfgContainer [2018-04-11 20:41:28,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 20:41:28,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 20:41:28,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 20:41:28,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 20:41:28,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 08:41:27" (1/3) ... [2018-04-11 20:41:28,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a82d736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 08:41:28, skipping insertion in model container [2018-04-11 20:41:28,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:41:28" (2/3) ... [2018-04-11 20:41:28,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a82d736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 08:41:28, skipping insertion in model container [2018-04-11 20:41:28,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 08:41:28" (3/3) ... [2018-04-11 20:41:28,812 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:41:28,822 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 20:41:28,830 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-04-11 20:41:28,880 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 20:41:28,881 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 20:41:28,881 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-11 20:41:28,881 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 20:41:28,882 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 20:41:28,882 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 20:41:28,882 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 20:41:28,882 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 20:41:28,882 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 20:41:28,883 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 20:41:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-04-11 20:41:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 20:41:28,908 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:28,909 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 20:41:28,909 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:28,914 INFO L82 PathProgramCache]: Analyzing trace with hash -156373956, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:28,929 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:28,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:29,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:41:29,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:29,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:29,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 20:41:29,088 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 20:41:29,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:29,096 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 20:41:29,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 20:41:29,110 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 20:41:29,110 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:29,132 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 20:41:29,168 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:29,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 20:41:29,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 20:41:29,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 20:41:29,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 20:41:29,189 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2018-04-11 20:41:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:29,305 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-04-11 20:41:29,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 20:41:29,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-11 20:41:29,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:29,318 INFO L225 Difference]: With dead ends: 117 [2018-04-11 20:41:29,318 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 20:41:29,321 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 2 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 20:41:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 20:41:29,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-11 20:41:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 20:41:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-04-11 20:41:29,357 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 19 [2018-04-11 20:41:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:29,358 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-04-11 20:41:29,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 20:41:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-04-11 20:41:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 20:41:29,359 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:29,359 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 20:41:29,359 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:29,359 INFO L82 PathProgramCache]: Analyzing trace with hash -156373955, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:29,366 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:29,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:29,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:41:29,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:29,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:41:29,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:29,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:29,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 20:41:29,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:29,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (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 20:41:29,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:29,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:29,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:29,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:41:29,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:29,619 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 20:41:29,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 20:41:29,662 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 20:41:29,662 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:29,936 WARN L148 SmtUtils]: Spent 183ms on a formula simplification that was a NOOP. DAG size: 26 [2018-04-11 20:41:29,949 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:29,949 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-04-11 20:41:29,956 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 20:41:29,975 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:29,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-11 20:41:29,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 20:41:29,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 20:41:29,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-11 20:41:29,977 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 9 states. [2018-04-11 20:41:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:30,136 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-04-11 20:41:30,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:41:30,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-04-11 20:41:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:30,149 INFO L225 Difference]: With dead ends: 83 [2018-04-11 20:41:30,150 INFO L226 Difference]: Without dead ends: 82 [2018-04-11 20:41:30,151 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-11 20:41:30,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-11 20:41:30,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-04-11 20:41:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 20:41:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-04-11 20:41:30,161 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 19 [2018-04-11 20:41:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:30,162 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-04-11 20:41:30,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 20:41:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-04-11 20:41:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 20:41:30,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:30,163 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:30,163 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:30,164 INFO L82 PathProgramCache]: Analyzing trace with hash -552625248, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:30,178 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:30,191 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:30,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:41:30,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:30,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:30,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 20:41:30,209 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 20:41:30,210 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:30,220 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 20:41:30,252 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:30,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 20:41:30,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 20:41:30,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 20:41:30,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 20:41:30,253 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 4 states. [2018-04-11 20:41:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:30,298 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-04-11 20:41:30,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 20:41:30,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 20:41:30,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:30,300 INFO L225 Difference]: With dead ends: 82 [2018-04-11 20:41:30,300 INFO L226 Difference]: Without dead ends: 81 [2018-04-11 20:41:30,301 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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 20:41:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-11 20:41:30,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-04-11 20:41:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-11 20:41:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-04-11 20:41:30,308 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 20 [2018-04-11 20:41:30,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:30,308 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-04-11 20:41:30,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 20:41:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-04-11 20:41:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 20:41:30,309 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:30,309 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:30,309 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:30,310 INFO L82 PathProgramCache]: Analyzing trace with hash -552625247, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:30,318 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:30,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:30,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:41:30,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:30,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:30,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 20:41:30,386 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 20:41:30,387 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:30,475 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 20:41:30,508 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:30,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-11 20:41:30,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 20:41:30,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 20:41:30,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 20:41:30,509 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 7 states. [2018-04-11 20:41:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:30,618 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-04-11 20:41:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:41:30,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-04-11 20:41:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:30,619 INFO L225 Difference]: With dead ends: 81 [2018-04-11 20:41:30,619 INFO L226 Difference]: Without dead ends: 80 [2018-04-11 20:41:30,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 20:41:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-11 20:41:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-04-11 20:41:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-11 20:41:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-04-11 20:41:30,626 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 20 [2018-04-11 20:41:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:30,627 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-04-11 20:41:30,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 20:41:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-04-11 20:41:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 20:41:30,628 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:30,628 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:30,628 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:30,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1883922487, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:30,638 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:30,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:30,672 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 20:41:30,672 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:30,681 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 20:41:30,701 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:30,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-11 20:41:30,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 20:41:30,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 20:41:30,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 20:41:30,702 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 6 states. [2018-04-11 20:41:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:30,832 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-04-11 20:41:30,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:41:30,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-11 20:41:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:30,835 INFO L225 Difference]: With dead ends: 107 [2018-04-11 20:41:30,835 INFO L226 Difference]: Without dead ends: 106 [2018-04-11 20:41:30,836 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 20:41:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-11 20:41:30,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2018-04-11 20:41:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-11 20:41:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-04-11 20:41:30,842 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 31 [2018-04-11 20:41:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:30,842 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-04-11 20:41:30,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 20:41:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-04-11 20:41:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 20:41:30,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:30,843 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:30,843 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:30,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1883922488, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:30,852 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:30,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:30,885 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 20:41:30,885 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:30,903 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 20:41:30,934 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:30,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-11 20:41:30,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 20:41:30,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 20:41:30,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 20:41:30,935 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 5 states. [2018-04-11 20:41:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:30,981 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2018-04-11 20:41:30,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:41:30,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-11 20:41:30,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:30,982 INFO L225 Difference]: With dead ends: 145 [2018-04-11 20:41:30,982 INFO L226 Difference]: Without dead ends: 121 [2018-04-11 20:41:30,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 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 20:41:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-11 20:41:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 90. [2018-04-11 20:41:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-11 20:41:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2018-04-11 20:41:30,992 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 31 [2018-04-11 20:41:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:30,992 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2018-04-11 20:41:30,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 20:41:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2018-04-11 20:41:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 20:41:30,993 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:30,994 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:30,994 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:30,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1602049071, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:31,005 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:31,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:31,077 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 20:41:31,078 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:31,082 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 20:41:31,101 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:31,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-11 20:41:31,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 20:41:31,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 20:41:31,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 20:41:31,102 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 7 states. [2018-04-11 20:41:31,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:31,229 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2018-04-11 20:41:31,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 20:41:31,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-04-11 20:41:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:31,230 INFO L225 Difference]: With dead ends: 110 [2018-04-11 20:41:31,231 INFO L226 Difference]: Without dead ends: 109 [2018-04-11 20:41:31,231 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-04-11 20:41:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-11 20:41:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2018-04-11 20:41:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-11 20:41:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-04-11 20:41:31,239 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 34 [2018-04-11 20:41:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:31,240 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-04-11 20:41:31,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 20:41:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-04-11 20:41:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 20:41:31,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:31,241 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:31,241 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:31,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1602049072, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:31,247 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:31,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:41:31,338 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:31,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 20:41:31,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:31,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-11 20:41:31,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:31,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:31,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-11 20:41:31,377 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 20:41:31,399 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:31,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-04-11 20:41:31,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 20:41:31,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 20:41:31,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 20:41:31,401 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 10 states. [2018-04-11 20:41:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:31,560 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-04-11 20:41:31,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 20:41:31,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-04-11 20:41:31,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:31,561 INFO L225 Difference]: With dead ends: 111 [2018-04-11 20:41:31,561 INFO L226 Difference]: Without dead ends: 110 [2018-04-11 20:41:31,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-04-11 20:41:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-04-11 20:41:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2018-04-11 20:41:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 20:41:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-04-11 20:41:31,567 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 34 [2018-04-11 20:41:31,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:31,567 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-04-11 20:41:31,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 20:41:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-04-11 20:41:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 20:41:31,568 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:31,568 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:31,568 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:31,569 INFO L82 PathProgramCache]: Analyzing trace with hash 937564900, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:31,574 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:31,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:31,636 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 20:41:31,636 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:31,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 20:41:31,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:31,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-11 20:41:31,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:31,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:31,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-11 20:41:31,671 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 20:41:31,690 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:31,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-11 20:41:31,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 20:41:31,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 20:41:31,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 20:41:31,691 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 9 states. [2018-04-11 20:41:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:31,809 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-04-11 20:41:31,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 20:41:31,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-04-11 20:41:31,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:31,810 INFO L225 Difference]: With dead ends: 119 [2018-04-11 20:41:31,810 INFO L226 Difference]: Without dead ends: 118 [2018-04-11 20:41:31,811 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-11 20:41:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-11 20:41:31,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2018-04-11 20:41:31,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 20:41:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-04-11 20:41:31,816 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 36 [2018-04-11 20:41:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:31,817 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-04-11 20:41:31,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 20:41:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-04-11 20:41:31,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 20:41:31,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:31,818 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:31,818 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:31,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1777398855, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:31,831 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:31,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:31,887 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 20:41:31,887 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:31,894 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 20:41:31,914 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:31,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-11 20:41:31,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 20:41:31,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 20:41:31,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 20:41:31,915 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 7 states. [2018-04-11 20:41:32,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:32,088 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-04-11 20:41:32,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 20:41:32,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-04-11 20:41:32,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:32,089 INFO L225 Difference]: With dead ends: 107 [2018-04-11 20:41:32,090 INFO L226 Difference]: Without dead ends: 106 [2018-04-11 20:41:32,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-11 20:41:32,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-11 20:41:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2018-04-11 20:41:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 20:41:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2018-04-11 20:41:32,095 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 38 [2018-04-11 20:41:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:32,096 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2018-04-11 20:41:32,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 20:41:32,096 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2018-04-11 20:41:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 20:41:32,097 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:32,097 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:32,097 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:32,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1777398856, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:32,110 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:32,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:32,210 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 20:41:32,210 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:32,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 20:41:32,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:32,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-11 20:41:32,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:32,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:32,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-11 20:41:32,354 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 20:41:32,374 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:32,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-04-11 20:41:32,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 20:41:32,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 20:41:32,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 20:41:32,375 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 10 states. [2018-04-11 20:41:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:32,594 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2018-04-11 20:41:32,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 20:41:32,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-11 20:41:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:32,595 INFO L225 Difference]: With dead ends: 110 [2018-04-11 20:41:32,595 INFO L226 Difference]: Without dead ends: 109 [2018-04-11 20:41:32,596 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-04-11 20:41:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-11 20:41:32,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-04-11 20:41:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-11 20:41:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2018-04-11 20:41:32,602 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 38 [2018-04-11 20:41:32,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:32,602 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2018-04-11 20:41:32,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 20:41:32,602 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2018-04-11 20:41:32,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 20:41:32,603 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:32,603 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:32,603 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:32,603 INFO L82 PathProgramCache]: Analyzing trace with hash -735210339, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:32,613 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:32,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:32,662 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 20:41:32,662 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:32,667 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 20:41:32,687 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:32,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-11 20:41:32,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 20:41:32,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 20:41:32,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 20:41:32,688 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 7 states. [2018-04-11 20:41:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:32,779 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2018-04-11 20:41:32,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 20:41:32,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-04-11 20:41:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:32,779 INFO L225 Difference]: With dead ends: 106 [2018-04-11 20:41:32,780 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 20:41:32,780 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-11 20:41:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 20:41:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-04-11 20:41:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 20:41:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-04-11 20:41:32,785 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 39 [2018-04-11 20:41:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:32,785 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-04-11 20:41:32,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 20:41:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-04-11 20:41:32,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 20:41:32,786 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:32,787 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:32,787 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:32,787 INFO L82 PathProgramCache]: Analyzing trace with hash -735210338, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:32,793 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:32,812 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:32,898 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 20:41:32,898 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:32,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 20:41:32,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:32,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-11 20:41:32,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:32,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:32,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-11 20:41:32,946 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 20:41:32,966 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:32,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-04-11 20:41:32,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 20:41:32,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 20:41:32,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 20:41:32,967 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 10 states. [2018-04-11 20:41:33,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:33,205 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-04-11 20:41:33,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 20:41:33,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-04-11 20:41:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:33,206 INFO L225 Difference]: With dead ends: 120 [2018-04-11 20:41:33,206 INFO L226 Difference]: Without dead ends: 119 [2018-04-11 20:41:33,207 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-04-11 20:41:33,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-04-11 20:41:33,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2018-04-11 20:41:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-11 20:41:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-04-11 20:41:33,211 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 39 [2018-04-11 20:41:33,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:33,211 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-04-11 20:41:33,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 20:41:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-04-11 20:41:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 20:41:33,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:33,212 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:33,212 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2071333303, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:33,220 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:33,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:33,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 20:41:33,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 20:41:33,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:33,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:33,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 20:41:33,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-11 20:41:33,400 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 20:41:33,407 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 20:41:33,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:41:33,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:33,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:33,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-11 20:41:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:41:33,477 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:33,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 20:41:33,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:33,696 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 13 treesize of output 11 [2018-04-11 20:41:33,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 20:41:33,706 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:33,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:33,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:33,716 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-04-11 20:41:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:41:33,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:41:33,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-11 20:41:33,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 20:41:33,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 20:41:33,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-04-11 20:41:33,744 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 21 states. [2018-04-11 20:41:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:36,592 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2018-04-11 20:41:36,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 20:41:36,593 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-04-11 20:41:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:36,594 INFO L225 Difference]: With dead ends: 137 [2018-04-11 20:41:36,594 INFO L226 Difference]: Without dead ends: 136 [2018-04-11 20:41:36,595 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=239, Invalid=1093, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 20:41:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-11 20:41:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 112. [2018-04-11 20:41:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-11 20:41:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2018-04-11 20:41:36,601 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 41 [2018-04-11 20:41:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:36,602 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2018-04-11 20:41:36,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 20:41:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2018-04-11 20:41:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 20:41:36,602 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:36,603 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:36,603 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:36,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1148291530, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:36,612 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:36,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:36,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:36,663 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 20:41:36,672 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 20:41:36,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:36,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:36,681 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 20:41:36,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 20:41:36,731 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-11 20:41:36,738 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-11 20:41:36,764 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 20:41:36,765 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:36,799 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_15| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc11.base_15| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_15| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_15|))))) is different from false [2018-04-11 20:41:36,805 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_14| Int) (|v_main_#t~malloc11.base_15| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_14| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_15| 1) |v_main_#t~malloc10.base_14| 0) |v_main_#t~malloc11.base_15| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_15|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_14|)))))) is different from false [2018-04-11 20:41:36,830 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 20:41:36,864 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:36,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-11 20:41:36,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 20:41:36,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 20:41:36,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-11 20:41:36,865 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 12 states. [2018-04-11 20:41:36,893 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_14| Int) (|v_main_#t~malloc11.base_15| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_14| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_15| 1) |v_main_#t~malloc10.base_14| 0) |v_main_#t~malloc11.base_15| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_15|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_14|))))))) is different from false [2018-04-11 20:41:37,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:37,212 INFO L93 Difference]: Finished difference Result 209 states and 234 transitions. [2018-04-11 20:41:37,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:41:37,212 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-04-11 20:41:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:37,213 INFO L225 Difference]: With dead ends: 209 [2018-04-11 20:41:37,213 INFO L226 Difference]: Without dead ends: 196 [2018-04-11 20:41:37,214 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-11 20:41:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-11 20:41:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 191. [2018-04-11 20:41:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 20:41:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2018-04-11 20:41:37,223 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 44 [2018-04-11 20:41:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:37,223 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2018-04-11 20:41:37,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 20:41:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2018-04-11 20:41:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 20:41:37,224 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:37,224 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:37,224 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:37,225 INFO L82 PathProgramCache]: Analyzing trace with hash -733054375, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:37,231 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:37,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:37,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:37,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 20:41:37,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:37,271 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 20:41:37,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:37,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:37,286 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 20:41:37,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 20:41:37,317 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-11 20:41:37,327 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-11 20:41:37,333 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 20:41:37,333 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:37,350 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_17| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_17| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_17| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_17|))))) is different from false [2018-04-11 20:41:37,355 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_16| Int) (|v_main_#t~malloc11.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_16| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_16|))) (not (= (select .cse0 |v_main_#t~malloc11.base_17|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_17| 1) |v_main_#t~malloc10.base_16| 0) |v_main_#t~malloc11.base_17| 0))))) is different from false [2018-04-11 20:41:37,367 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 20:41:37,386 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:37,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-11 20:41:37,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 20:41:37,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 20:41:37,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-11 20:41:37,387 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand 12 states. [2018-04-11 20:41:37,395 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_16| Int) (|v_main_#t~malloc11.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_16| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_16|))) (not (= (select .cse0 |v_main_#t~malloc11.base_17|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_17| 1) |v_main_#t~malloc10.base_16| 0) |v_main_#t~malloc11.base_17| 0)))))) is different from false [2018-04-11 20:41:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:37,764 INFO L93 Difference]: Finished difference Result 287 states and 324 transitions. [2018-04-11 20:41:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:41:37,765 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-04-11 20:41:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:37,766 INFO L225 Difference]: With dead ends: 287 [2018-04-11 20:41:37,766 INFO L226 Difference]: Without dead ends: 274 [2018-04-11 20:41:37,766 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-11 20:41:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-11 20:41:37,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 190. [2018-04-11 20:41:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-11 20:41:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2018-04-11 20:41:37,778 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 45 [2018-04-11 20:41:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:37,778 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2018-04-11 20:41:37,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 20:41:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2018-04-11 20:41:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 20:41:37,779 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:37,779 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:37,779 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:37,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1428528404, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:37,785 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:37,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:37,832 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 20:41:37,832 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:37,890 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 20:41:37,910 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:37,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [] total 11 [2018-04-11 20:41:37,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 20:41:37,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 20:41:37,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-11 20:41:37,910 INFO L87 Difference]: Start difference. First operand 190 states and 215 transitions. Second operand 11 states. [2018-04-11 20:41:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:38,131 INFO L93 Difference]: Finished difference Result 293 states and 323 transitions. [2018-04-11 20:41:38,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 20:41:38,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-04-11 20:41:38,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:38,133 INFO L225 Difference]: With dead ends: 293 [2018-04-11 20:41:38,133 INFO L226 Difference]: Without dead ends: 238 [2018-04-11 20:41:38,134 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2018-04-11 20:41:38,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-11 20:41:38,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 189. [2018-04-11 20:41:38,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 20:41:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2018-04-11 20:41:38,145 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 45 [2018-04-11 20:41:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:38,145 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2018-04-11 20:41:38,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 20:41:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2018-04-11 20:41:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 20:41:38,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:38,146 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:38,146 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:38,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1610995837, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:38,153 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:38,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:38,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:41:38,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:38,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:41:38,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:38,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:38,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:41:38,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:38,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (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 20:41:38,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:38,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:38,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:38,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (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 20:41:38,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:38,242 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 20:41:38,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:41:38,398 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 20:41:38,398 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:38,763 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 20:41:38,783 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:38,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 14] imperfect sequences [] total 28 [2018-04-11 20:41:38,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 20:41:38,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 20:41:38,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2018-04-11 20:41:38,784 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand 29 states. [2018-04-11 20:41:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:40,047 INFO L93 Difference]: Finished difference Result 294 states and 329 transitions. [2018-04-11 20:41:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 20:41:40,048 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 46 [2018-04-11 20:41:40,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:40,049 INFO L225 Difference]: With dead ends: 294 [2018-04-11 20:41:40,049 INFO L226 Difference]: Without dead ends: 293 [2018-04-11 20:41:40,050 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=432, Invalid=2324, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 20:41:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-11 20:41:40,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 220. [2018-04-11 20:41:40,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 20:41:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 249 transitions. [2018-04-11 20:41:40,061 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 249 transitions. Word has length 46 [2018-04-11 20:41:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:40,062 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 249 transitions. [2018-04-11 20:41:40,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 20:41:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 249 transitions. [2018-04-11 20:41:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 20:41:40,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:40,062 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:40,062 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:40,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2103473680, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:40,068 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:40,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:40,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:41:40,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:40,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:40,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 20:41:40,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 20:41:40,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 20:41:40,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:40,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:40,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:40,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-11 20:41:40,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 20:41:40,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 20:41:40,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:41:40,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:40,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:40,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 20:41:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:41:40,256 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:40,704 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 13 treesize of output 11 [2018-04-11 20:41:40,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 20:41:40,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:40,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:40,727 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 20:41:40,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-04-11 20:41:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:41:40,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:41:40,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-04-11 20:41:40,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 20:41:40,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 20:41:40,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2018-04-11 20:41:40,879 INFO L87 Difference]: Start difference. First operand 220 states and 249 transitions. Second operand 30 states. [2018-04-11 20:41:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:42,018 INFO L93 Difference]: Finished difference Result 244 states and 272 transitions. [2018-04-11 20:41:42,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 20:41:42,018 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-04-11 20:41:42,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:42,019 INFO L225 Difference]: With dead ends: 244 [2018-04-11 20:41:42,019 INFO L226 Difference]: Without dead ends: 216 [2018-04-11 20:41:42,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=513, Invalid=2037, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 20:41:42,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-11 20:41:42,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 185. [2018-04-11 20:41:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 20:41:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2018-04-11 20:41:42,031 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 48 [2018-04-11 20:41:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:42,031 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2018-04-11 20:41:42,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 20:41:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2018-04-11 20:41:42,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 20:41:42,031 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:42,032 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:42,032 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:42,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1217280458, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:42,039 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:42,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:42,073 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 20:41:42,073 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:42,093 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 20:41:42,112 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:42,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-11 20:41:42,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 20:41:42,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 20:41:42,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 20:41:42,113 INFO L87 Difference]: Start difference. First operand 185 states and 208 transitions. Second operand 5 states. [2018-04-11 20:41:42,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:42,131 INFO L93 Difference]: Finished difference Result 214 states and 239 transitions. [2018-04-11 20:41:42,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 20:41:42,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-04-11 20:41:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:42,134 INFO L225 Difference]: With dead ends: 214 [2018-04-11 20:41:42,134 INFO L226 Difference]: Without dead ends: 185 [2018-04-11 20:41:42,135 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 1 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 20:41:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-11 20:41:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-04-11 20:41:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 20:41:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 204 transitions. [2018-04-11 20:41:42,147 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 204 transitions. Word has length 49 [2018-04-11 20:41:42,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:42,147 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 204 transitions. [2018-04-11 20:41:42,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 20:41:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 204 transitions. [2018-04-11 20:41:42,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 20:41:42,148 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:42,148 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:42,148 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:42,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1069605921, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:42,158 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:42,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:42,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 20:41:42,240 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:42,247 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 20:41:42,278 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:42,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2018-04-11 20:41:42,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 20:41:42,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 20:41:42,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 20:41:42,279 INFO L87 Difference]: Start difference. First operand 185 states and 204 transitions. Second operand 8 states. [2018-04-11 20:41:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:42,379 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2018-04-11 20:41:42,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 20:41:42,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-04-11 20:41:42,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:42,380 INFO L225 Difference]: With dead ends: 185 [2018-04-11 20:41:42,380 INFO L226 Difference]: Without dead ends: 184 [2018-04-11 20:41:42,381 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-04-11 20:41:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-11 20:41:42,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-04-11 20:41:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-11 20:41:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 202 transitions. [2018-04-11 20:41:42,388 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 202 transitions. Word has length 50 [2018-04-11 20:41:42,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:42,389 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 202 transitions. [2018-04-11 20:41:42,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 20:41:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 202 transitions. [2018-04-11 20:41:42,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 20:41:42,389 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:42,389 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:42,389 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:42,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1069605920, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:42,401 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:42,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:42,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:41:42,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:42,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:41:42,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:42,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:42,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-04-11 20:41:42,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:42,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:42,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:41:42,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:42,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (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 20:41:42,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:42,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:42,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 20:41:43,456 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 20:41:43,457 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:44,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 20:41:44,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:44,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-11 20:41:44,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-11 20:41:44,772 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:44,773 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 20:41:44,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:44,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:44,785 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 20:41:44,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:14 [2018-04-11 20:41:44,961 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 20:41:44,981 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:44,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24, 25] imperfect sequences [] total 48 [2018-04-11 20:41:44,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-11 20:41:44,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-11 20:41:44,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2061, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 20:41:44,983 INFO L87 Difference]: Start difference. First operand 184 states and 202 transitions. Second operand 48 states. [2018-04-11 20:41:46,927 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 83 DAG size of output 80 [2018-04-11 20:41:47,149 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 85 DAG size of output 81 [2018-04-11 20:41:47,497 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 77 DAG size of output 73 [2018-04-11 20:41:47,783 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 68 DAG size of output 65 [2018-04-11 20:41:48,158 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 76 DAG size of output 73 [2018-04-11 20:41:48,351 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 62 DAG size of output 60 [2018-04-11 20:41:48,792 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 66 DAG size of output 64 [2018-04-11 20:41:49,013 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-11 20:41:49,458 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-04-11 20:41:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:51,072 INFO L93 Difference]: Finished difference Result 326 states and 356 transitions. [2018-04-11 20:41:51,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-11 20:41:51,073 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 50 [2018-04-11 20:41:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:51,074 INFO L225 Difference]: With dead ends: 326 [2018-04-11 20:41:51,074 INFO L226 Difference]: Without dead ends: 290 [2018-04-11 20:41:51,075 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1697 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1169, Invalid=7573, Unknown=0, NotChecked=0, Total=8742 [2018-04-11 20:41:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-04-11 20:41:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 217. [2018-04-11 20:41:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-11 20:41:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 242 transitions. [2018-04-11 20:41:51,085 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 242 transitions. Word has length 50 [2018-04-11 20:41:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:51,086 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 242 transitions. [2018-04-11 20:41:51,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-11 20:41:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 242 transitions. [2018-04-11 20:41:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 20:41:51,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:51,087 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:51,087 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1394559947, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:51,096 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:51,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:51,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 20:41:51,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 20:41:51,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:51,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:51,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 20:41:51,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-11 20:41:51,253 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 20:41:51,260 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 20:41:51,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:41:51,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:51,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:51,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-11 20:41:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:41:51,332 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:51,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 20:41:51,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:51,536 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 13 treesize of output 11 [2018-04-11 20:41:51,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 20:41:51,544 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:51,546 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:51,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:51,551 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-04-11 20:41:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:41:51,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:41:51,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-11 20:41:51,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 20:41:51,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 20:41:51,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-04-11 20:41:51,579 INFO L87 Difference]: Start difference. First operand 217 states and 242 transitions. Second operand 21 states. [2018-04-11 20:41:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:52,755 INFO L93 Difference]: Finished difference Result 247 states and 269 transitions. [2018-04-11 20:41:52,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 20:41:52,755 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-04-11 20:41:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:52,756 INFO L225 Difference]: With dead ends: 247 [2018-04-11 20:41:52,756 INFO L226 Difference]: Without dead ends: 246 [2018-04-11 20:41:52,757 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=953, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 20:41:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-11 20:41:52,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 217. [2018-04-11 20:41:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-11 20:41:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 240 transitions. [2018-04-11 20:41:52,770 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 240 transitions. Word has length 53 [2018-04-11 20:41:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:52,770 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 240 transitions. [2018-04-11 20:41:52,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 20:41:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 240 transitions. [2018-04-11 20:41:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 20:41:52,771 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:52,771 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:52,771 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:52,771 INFO L82 PathProgramCache]: Analyzing trace with hash 281685371, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:52,780 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:52,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:52,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:41:52,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:52,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:41:52,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:52,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:52,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:41:52,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:52,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:52,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:41:52,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:52,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 20:41:52,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:52,852 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 20:41:52,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:41:53,009 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 20:41:53,009 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:53,495 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 20:41:53,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:41:53,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2018-04-11 20:41:53,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 20:41:53,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 20:41:53,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-04-11 20:41:53,527 INFO L87 Difference]: Start difference. First operand 217 states and 240 transitions. Second operand 31 states. [2018-04-11 20:41:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:54,829 INFO L93 Difference]: Finished difference Result 248 states and 272 transitions. [2018-04-11 20:41:54,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 20:41:54,830 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-04-11 20:41:54,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:54,831 INFO L225 Difference]: With dead ends: 248 [2018-04-11 20:41:54,831 INFO L226 Difference]: Without dead ends: 247 [2018-04-11 20:41:54,832 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=461, Invalid=2731, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 20:41:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-11 20:41:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 217. [2018-04-11 20:41:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-11 20:41:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2018-04-11 20:41:54,841 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 54 [2018-04-11 20:41:54,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:54,842 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2018-04-11 20:41:54,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 20:41:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2018-04-11 20:41:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 20:41:54,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:54,842 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:54,843 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:54,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1419306272, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:54,849 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:54,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:54,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:54,887 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 20:41:54,889 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 20:41:54,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:54,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:54,896 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 20:41:54,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 20:41:54,919 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-11 20:41:54,923 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-11 20:41:54,929 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 20:41:54,929 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:54,946 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_25| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_25| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_25| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_25|))))) is different from false [2018-04-11 20:41:54,960 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_25| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_25| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_25| 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_25|) 0))))) is different from false [2018-04-11 20:41:54,977 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 20:41:55,009 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:55,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-11 20:41:55,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 20:41:55,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 20:41:55,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-11 20:41:55,010 INFO L87 Difference]: Start difference. First operand 217 states and 238 transitions. Second operand 12 states. [2018-04-11 20:41:55,021 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_25| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_25| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_25| 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_25|) 0)))))) is different from false [2018-04-11 20:41:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:55,345 INFO L93 Difference]: Finished difference Result 336 states and 368 transitions. [2018-04-11 20:41:55,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:41:55,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-04-11 20:41:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:55,347 INFO L225 Difference]: With dead ends: 336 [2018-04-11 20:41:55,347 INFO L226 Difference]: Without dead ends: 308 [2018-04-11 20:41:55,347 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-11 20:41:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-04-11 20:41:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 219. [2018-04-11 20:41:55,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-11 20:41:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 241 transitions. [2018-04-11 20:41:55,358 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 241 transitions. Word has length 54 [2018-04-11 20:41:55,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:55,359 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 241 transitions. [2018-04-11 20:41:55,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 20:41:55,359 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 241 transitions. [2018-04-11 20:41:55,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 20:41:55,360 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:55,360 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:41:55,360 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:55,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1802000771, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:55,369 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:55,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:55,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:55,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 20:41:55,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:55,417 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 20:41:55,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:55,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:55,424 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 20:41:55,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 20:41:55,460 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-11 20:41:55,463 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-11 20:41:55,470 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 20:41:55,470 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:55,488 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_27| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_27| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_27| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_27|))))) is different from false [2018-04-11 20:41:55,491 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_27| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_27| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_27| 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_27|) 0))))) is different from false [2018-04-11 20:41:55,511 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 20:41:55,531 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:55,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-11 20:41:55,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 20:41:55,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 20:41:55,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-11 20:41:55,533 INFO L87 Difference]: Start difference. First operand 219 states and 241 transitions. Second operand 12 states. [2018-04-11 20:41:55,543 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_27| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_27| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_27| 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_27|) 0)))))) is different from false [2018-04-11 20:41:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:55,808 INFO L93 Difference]: Finished difference Result 223 states and 241 transitions. [2018-04-11 20:41:55,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:41:55,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-11 20:41:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:55,809 INFO L225 Difference]: With dead ends: 223 [2018-04-11 20:41:55,809 INFO L226 Difference]: Without dead ends: 195 [2018-04-11 20:41:55,810 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-11 20:41:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-11 20:41:55,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 104. [2018-04-11 20:41:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 20:41:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-04-11 20:41:55,819 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 55 [2018-04-11 20:41:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:55,820 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-04-11 20:41:55,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 20:41:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-04-11 20:41:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 20:41:55,820 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:55,821 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:41:55,821 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:55,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1221350794, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:55,830 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:55,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:55,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 20:41:55,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 20:41:55,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:55,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:55,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 20:41:55,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-11 20:41:55,965 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 20:41:55,972 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 20:41:55,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:41:55,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:56,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:56,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-11 20:41:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:41:56,056 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:56,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 20:41:56,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:56,276 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 13 treesize of output 11 [2018-04-11 20:41:56,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 20:41:56,286 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:56,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:56,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:56,303 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-04-11 20:41:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:41:56,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:41:56,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-11 20:41:56,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 20:41:56,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 20:41:56,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-04-11 20:41:56,352 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 21 states. [2018-04-11 20:41:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:58,925 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-04-11 20:41:58,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 20:41:58,926 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-04-11 20:41:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:58,926 INFO L225 Difference]: With dead ends: 112 [2018-04-11 20:41:58,927 INFO L226 Difference]: Without dead ends: 111 [2018-04-11 20:41:58,927 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2018-04-11 20:41:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-04-11 20:41:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2018-04-11 20:41:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 20:41:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-04-11 20:41:58,937 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 55 [2018-04-11 20:41:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:58,938 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-04-11 20:41:58,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 20:41:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-04-11 20:41:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 20:41:58,939 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:58,939 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:41:58,939 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:58,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1542585600, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:58,946 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:58,967 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 20:41:58,979 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:41:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 20:41:59,022 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:41:59,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-04-11 20:41:59,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 20:41:59,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 20:41:59,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-11 20:41:59,023 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 7 states. [2018-04-11 20:41:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:41:59,064 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-04-11 20:41:59,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 20:41:59,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-04-11 20:41:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:41:59,065 INFO L225 Difference]: With dead ends: 120 [2018-04-11 20:41:59,065 INFO L226 Difference]: Without dead ends: 95 [2018-04-11 20:41:59,065 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-11 20:41:59,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-11 20:41:59,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-04-11 20:41:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-11 20:41:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-04-11 20:41:59,071 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 61 [2018-04-11 20:41:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:41:59,071 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-04-11 20:41:59,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 20:41:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-04-11 20:41:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 20:41:59,072 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:41:59,072 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:41:59,072 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:41:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1162765393, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:41:59,092 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:41:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:41:59,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:41:59,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:41:59,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:59,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:59,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 20:41:59,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:41:59,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:59,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:59,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:41:59,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (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 20:41:59,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:59,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:59,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 20:41:59,151 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 20:41:59,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 20:41:59,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:59,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:59,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:59,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 20:41:59,298 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 20:41:59,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 20:41:59,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:59,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:59,309 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 20:41:59,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-11 20:41:59,332 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 20:41:59,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 20:41:59,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:59,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:41:59,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 20:41:59,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-11 20:41:59,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-11 20:41:59,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 20:41:59,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:41:59,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 20:41:59,436 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 20:41:59,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:59,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:41:59,446 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-04-11 20:41:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:41:59,526 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:42:00,304 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-11 20:42:00,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 20:42:00,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:00,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 20:42:00,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-11 20:42:00,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:00,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:00,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 20:42:00,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-04-11 20:42:00,342 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:00,343 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:00,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:42:00,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:42:00,374 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:84 [2018-04-11 20:42:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:00,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:42:00,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 43 [2018-04-11 20:42:00,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 20:42:00,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 20:42:00,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1756, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 20:42:00,589 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 44 states. [2018-04-11 20:42:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:42:02,398 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-04-11 20:42:02,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 20:42:02,399 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 62 [2018-04-11 20:42:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:42:02,399 INFO L225 Difference]: With dead ends: 102 [2018-04-11 20:42:02,399 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 20:42:02,401 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=589, Invalid=4523, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 20:42:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 20:42:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-11 20:42:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 20:42:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-04-11 20:42:02,410 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 62 [2018-04-11 20:42:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:42:02,411 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-04-11 20:42:02,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 20:42:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-04-11 20:42:02,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 20:42:02,411 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:42:02,412 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:42:02,412 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:42:02,412 INFO L82 PathProgramCache]: Analyzing trace with hash -364139388, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:42:02,420 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:42:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:42:02,450 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:42:02,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:42:02,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:02,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:42:02,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:02,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:02,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:42:02,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:02,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:02,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (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 20:42:02,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:02,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 20:42:02,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:02,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 20:42:02,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:42:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:02,744 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:42:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:03,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:42:03,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-04-11 20:42:03,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 20:42:03,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 20:42:03,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1347, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 20:42:03,468 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 39 states. [2018-04-11 20:42:04,925 WARN L151 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 59 DAG size of output 52 [2018-04-11 20:42:05,389 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 54 DAG size of output 52 [2018-04-11 20:42:05,557 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 61 DAG size of output 60 [2018-04-11 20:42:05,849 WARN L151 SmtUtils]: Spent 238ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-11 20:42:06,782 WARN L151 SmtUtils]: Spent 246ms on a formula simplification. DAG size of input: 67 DAG size of output 62 [2018-04-11 20:42:07,684 WARN L151 SmtUtils]: Spent 294ms on a formula simplification. DAG size of input: 73 DAG size of output 71 [2018-04-11 20:42:07,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:42:07,685 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2018-04-11 20:42:07,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 20:42:07,685 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 66 [2018-04-11 20:42:07,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:42:07,685 INFO L225 Difference]: With dead ends: 143 [2018-04-11 20:42:07,686 INFO L226 Difference]: Without dead ends: 142 [2018-04-11 20:42:07,687 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1038, Invalid=6102, Unknown=0, NotChecked=0, Total=7140 [2018-04-11 20:42:07,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-11 20:42:07,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2018-04-11 20:42:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 20:42:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2018-04-11 20:42:07,695 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 66 [2018-04-11 20:42:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:42:07,695 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2018-04-11 20:42:07,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 20:42:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2018-04-11 20:42:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 20:42:07,696 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:42:07,696 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:42:07,696 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:42:07,696 INFO L82 PathProgramCache]: Analyzing trace with hash 675061224, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:42:07,701 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:42:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:42:07,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:42:07,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:42:07,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:07,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:07,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 20:42:07,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:42:07,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:07,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:07,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:07,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (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 20:42:07,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:07,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:07,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 20:42:07,757 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 20:42:07,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 20:42:07,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:07,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:07,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:07,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 20:42:07,914 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 20:42:07,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 20:42:07,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:07,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:07,926 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 20:42:07,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-11 20:42:07,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 20:42:07,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 20:42:07,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:08,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:42:08,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:42:08,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 20:42:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:08,083 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:42:08,760 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-04-11 20:42:08,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 20:42:08,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:08,786 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 18 [2018-04-11 20:42:08,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-11 20:42:08,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:08,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:08,793 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 20:42:08,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-11 20:42:08,796 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:08,798 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:08,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:42:08,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:42:08,826 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-11 20:42:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:09,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:42:09,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-04-11 20:42:09,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 20:42:09,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 20:42:09,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 20:42:09,007 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand 42 states. [2018-04-11 20:42:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:42:10,289 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-11 20:42:10,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 20:42:10,290 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 68 [2018-04-11 20:42:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:42:10,290 INFO L225 Difference]: With dead ends: 134 [2018-04-11 20:42:10,290 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 20:42:10,291 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=364, Invalid=3418, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 20:42:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 20:42:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2018-04-11 20:42:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 20:42:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2018-04-11 20:42:10,299 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 68 [2018-04-11 20:42:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:42:10,299 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2018-04-11 20:42:10,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 20:42:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2018-04-11 20:42:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 20:42:10,300 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:42:10,300 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:42:10,300 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:42:10,300 INFO L82 PathProgramCache]: Analyzing trace with hash -547938562, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:42:10,306 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:42:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:42:10,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:42:10,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:42:10,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:10,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:42:10,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:10,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:10,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:42:10,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:10,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (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 20:42:10,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:10,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:10,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:10,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (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 20:42:10,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:10,384 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 20:42:10,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:42:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:10,630 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:42:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:11,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:42:11,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-04-11 20:42:11,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 20:42:11,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 20:42:11,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 20:42:11,315 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 39 states. [2018-04-11 20:42:12,554 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 60 DAG size of output 51 [2018-04-11 20:42:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:42:13,813 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2018-04-11 20:42:13,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 20:42:13,813 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 69 [2018-04-11 20:42:13,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:42:13,813 INFO L225 Difference]: With dead ends: 140 [2018-04-11 20:42:13,813 INFO L226 Difference]: Without dead ends: 139 [2018-04-11 20:42:13,815 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=698, Invalid=4414, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 20:42:13,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-11 20:42:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2018-04-11 20:42:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 20:42:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2018-04-11 20:42:13,828 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 69 [2018-04-11 20:42:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:42:13,828 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2018-04-11 20:42:13,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 20:42:13,828 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2018-04-11 20:42:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-11 20:42:13,829 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:42:13,829 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:42:13,829 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:42:13,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1272812647, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:42:13,838 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:42:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:42:13,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:42:13,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:42:13,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:13,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:13,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 20:42:13,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:13,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:13,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (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 20:42:13,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:13,880 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 20:42:13,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:13,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:13,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 20:42:13,897 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 20:42:13,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 20:42:13,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:13,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:13,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:13,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 20:42:14,025 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 20:42:14,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 8 treesize of output 7 [2018-04-11 20:42:14,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:14,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:14,036 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 20:42:14,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-11 20:42:14,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 20:42:14,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 20:42:14,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:14,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:42:14,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:42:14,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 20:42:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:14,182 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:42:14,859 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-04-11 20:42:14,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 20:42:14,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:14,883 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 18 [2018-04-11 20:42:14,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-11 20:42:14,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:14,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:14,890 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 20:42:14,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-11 20:42:14,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:14,895 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:14,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:42:14,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:42:14,922 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-11 20:42:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:15,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:42:15,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-04-11 20:42:15,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 20:42:15,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 20:42:15,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 20:42:15,104 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand 42 states. [2018-04-11 20:42:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:42:16,355 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2018-04-11 20:42:16,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 20:42:16,355 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 70 [2018-04-11 20:42:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:42:16,356 INFO L225 Difference]: With dead ends: 134 [2018-04-11 20:42:16,356 INFO L226 Difference]: Without dead ends: 125 [2018-04-11 20:42:16,357 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=360, Invalid=3422, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 20:42:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-11 20:42:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-04-11 20:42:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 20:42:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-04-11 20:42:16,366 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 70 [2018-04-11 20:42:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:42:16,367 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-04-11 20:42:16,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 20:42:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-04-11 20:42:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-11 20:42:16,367 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:42:16,367 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:42:16,368 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:42:16,368 INFO L82 PathProgramCache]: Analyzing trace with hash 471281195, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:42:16,374 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:42:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:42:16,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:42:16,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:42:16,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:16,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:16,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 20:42:16,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:42:16,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:16,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:16,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:16,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (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 20:42:16,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:16,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:16,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 20:42:16,437 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 20:42:16,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 20:42:16,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:16,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:16,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:16,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 20:42:16,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 20:42:16,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 20:42:16,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:16,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:16,594 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 20:42:16,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-11 20:42:16,673 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 20:42:16,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 20:42:16,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:16,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:16,683 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 20:42:16,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-11 20:42:16,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 20:42:16,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 20:42:16,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:16,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:42:16,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:42:16,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 20:42:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 7 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:16,850 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:42:18,139 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-04-11 20:42:18,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 20:42:18,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:18,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 18 [2018-04-11 20:42:18,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-11 20:42:18,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:18,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:18,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2018-04-11 20:42:18,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-04-11 20:42:18,171 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:18,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-11 20:42:18,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:42:18,193 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:18,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-04-11 20:42:18,198 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:18,208 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-11 20:42:18,248 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 52 [2018-04-11 20:42:18,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-04-11 20:42:18,309 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:18,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-04-11 20:42:18,312 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:18,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-11 20:42:18,370 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-04-11 20:42:18,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-11 20:42:18,382 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-11 20:42:18,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2018-04-11 20:42:18,437 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:18,457 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 20:42:18,475 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 20:42:18,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-11 20:42:18,485 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 21 treesize of output 32 [2018-04-11 20:42:18,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-11 20:42:18,508 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:18,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-11 20:42:18,510 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:18,515 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-11 20:42:18,516 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:18,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 20:42:18,553 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:18,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-11 20:42:18,563 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 3 xjuncts. [2018-04-11 20:42:18,588 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:42:18,606 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:42:18,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 20:42:18,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:42:18,660 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 6 variables, input treesize:58, output treesize:84 [2018-04-11 20:42:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:18,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:42:18,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-04-11 20:42:18,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-11 20:42:18,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-11 20:42:18,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2473, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 20:42:18,908 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 52 states. [2018-04-11 20:42:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:42:21,513 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-04-11 20:42:21,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 20:42:21,513 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 83 [2018-04-11 20:42:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:42:21,514 INFO L225 Difference]: With dead ends: 125 [2018-04-11 20:42:21,514 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 20:42:21,515 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1381 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1170, Invalid=6486, Unknown=0, NotChecked=0, Total=7656 [2018-04-11 20:42:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 20:42:21,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-04-11 20:42:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 20:42:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2018-04-11 20:42:21,523 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 83 [2018-04-11 20:42:21,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:42:21,523 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2018-04-11 20:42:21,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-11 20:42:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2018-04-11 20:42:21,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 20:42:21,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:42:21,524 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:42:21,524 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:42:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1286266902, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:42:21,529 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:42:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:42:21,560 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:42:21,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:42:21,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:21,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:21,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 20:42:21,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:42:21,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:21,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:21,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:21,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (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 20:42:21,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:21,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:21,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 20:42:21,600 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 20:42:21,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 20:42:21,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:21,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:21,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:21,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 20:42:21,749 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 20:42:21,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 20:42:21,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:21,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:21,759 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 20:42:21,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-11 20:42:21,836 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 20:42:21,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 20:42:21,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:21,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:21,847 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 20:42:21,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-11 20:42:21,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 20:42:21,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 20:42:21,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:21,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:42:21,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:42:21,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 20:42:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 7 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:22,011 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:42:23,339 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-04-11 20:42:23,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 20:42:23,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:23,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-11 20:42:23,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-04-11 20:42:23,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-11 20:42:23,390 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:23,396 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-11 20:42:23,396 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:23,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-11 20:42:23,401 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:23,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 20:42:23,441 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:23,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-11 20:42:23,452 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 3 xjuncts. [2018-04-11 20:42:23,477 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:42:23,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:42:23,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2018-04-11 20:42:23,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-04-11 20:42:23,503 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:23,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-11 20:42:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:42:23,525 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:23,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-04-11 20:42:23,531 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:23,540 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-11 20:42:23,582 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 52 [2018-04-11 20:42:23,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-11 20:42:23,654 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2018-04-11 20:42:23,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-11 20:42:23,665 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2018-04-11 20:42:23,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2018-04-11 20:42:23,729 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:23,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-04-11 20:42:23,774 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:23,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-04-11 20:42:23,780 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-11 20:42:23,804 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:42:23,823 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 20:42:23,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 18 [2018-04-11 20:42:23,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-11 20:42:23,826 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:23,829 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:23,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 20:42:23,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:42:23,885 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 6 variables, input treesize:58, output treesize:84 [2018-04-11 20:42:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:24,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:42:24,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-04-11 20:42:24,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-11 20:42:24,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-11 20:42:24,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2473, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 20:42:24,118 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 52 states. [2018-04-11 20:42:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:42:26,481 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2018-04-11 20:42:26,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 20:42:26,481 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 85 [2018-04-11 20:42:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:42:26,482 INFO L225 Difference]: With dead ends: 124 [2018-04-11 20:42:26,482 INFO L226 Difference]: Without dead ends: 115 [2018-04-11 20:42:26,482 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=982, Invalid=6158, Unknown=0, NotChecked=0, Total=7140 [2018-04-11 20:42:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-11 20:42:26,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-04-11 20:42:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 20:42:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-04-11 20:42:26,490 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 85 [2018-04-11 20:42:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:42:26,490 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-04-11 20:42:26,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-11 20:42:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-04-11 20:42:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-11 20:42:26,491 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:42:26,491 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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 20:42:26,491 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:42:26,491 INFO L82 PathProgramCache]: Analyzing trace with hash 268321118, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:42:26,498 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:42:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:42:26,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:42:26,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:42:26,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:26,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:42:26,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:26,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:26,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:42:26,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:26,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:26,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (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 20:42:26,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:26,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 20:42:26,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:26,578 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 20:42:26,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:42:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:26,955 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:42:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:28,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:42:28,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2018-04-11 20:42:28,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 20:42:28,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 20:42:28,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2381, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 20:42:28,121 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 51 states. [2018-04-11 20:42:30,983 WARN L151 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 94 DAG size of output 77 [2018-04-11 20:42:31,218 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 95 DAG size of output 62 [2018-04-11 20:42:32,050 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 59 DAG size of output 47 [2018-04-11 20:42:32,498 WARN L151 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 87 DAG size of output 64 [2018-04-11 20:42:32,775 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 77 DAG size of output 61 [2018-04-11 20:42:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:42:34,533 INFO L93 Difference]: Finished difference Result 177 states and 184 transitions. [2018-04-11 20:42:34,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-11 20:42:34,533 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2018-04-11 20:42:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:42:34,534 INFO L225 Difference]: With dead ends: 177 [2018-04-11 20:42:34,534 INFO L226 Difference]: Without dead ends: 167 [2018-04-11 20:42:34,535 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1447, Invalid=10109, Unknown=0, NotChecked=0, Total=11556 [2018-04-11 20:42:34,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-11 20:42:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-04-11 20:42:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-11 20:42:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2018-04-11 20:42:34,545 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 99 [2018-04-11 20:42:34,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:42:34,546 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2018-04-11 20:42:34,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 20:42:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-04-11 20:42:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-04-11 20:42:34,546 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:42:34,546 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:42:34,546 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:42:34,547 INFO L82 PathProgramCache]: Analyzing trace with hash 359190884, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:42:34,552 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:42:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:42:34,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:42:34,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:42:34,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:34,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:42:34,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:34,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:42:34,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:42:34,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:34,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 20:42:34,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:34,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:34,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:42:34,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:42:34,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:42:34,679 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 20:42:34,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:42:35,472 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:35,472 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:42:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:42:38,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:42:38,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 74 [2018-04-11 20:42:38,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-11 20:42:38,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-11 20:42:38,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=5054, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 20:42:38,209 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 75 states. [2018-04-11 20:42:45,100 WARN L151 SmtUtils]: Spent 686ms on a formula simplification. DAG size of input: 131 DAG size of output 114 [2018-04-11 20:42:46,671 WARN L151 SmtUtils]: Spent 993ms on a formula simplification. DAG size of input: 126 DAG size of output 124 [2018-04-11 20:42:47,253 WARN L151 SmtUtils]: Spent 437ms on a formula simplification. DAG size of input: 127 DAG size of output 123 [2018-04-11 20:42:49,210 WARN L151 SmtUtils]: Spent 1782ms on a formula simplification. DAG size of input: 177 DAG size of output 175 [2018-04-11 20:42:49,885 WARN L148 SmtUtils]: Spent 340ms on a formula simplification that was a NOOP. DAG size: 160 [2018-04-11 20:42:50,424 WARN L148 SmtUtils]: Spent 342ms on a formula simplification that was a NOOP. DAG size: 160 [2018-04-11 20:42:50,840 WARN L148 SmtUtils]: Spent 161ms on a formula simplification that was a NOOP. DAG size: 108 [2018-04-11 20:42:51,201 WARN L148 SmtUtils]: Spent 183ms on a formula simplification that was a NOOP. DAG size: 112 [2018-04-11 20:42:51,576 WARN L148 SmtUtils]: Spent 143ms on a formula simplification that was a NOOP. DAG size: 107 [2018-04-11 20:42:51,847 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 102 DAG size of output 87 [2018-04-11 20:42:52,187 WARN L148 SmtUtils]: Spent 136ms on a formula simplification that was a NOOP. DAG size: 100 [2018-04-11 20:42:53,770 WARN L151 SmtUtils]: Spent 1430ms on a formula simplification. DAG size of input: 175 DAG size of output 168 [2018-04-11 20:42:54,288 WARN L148 SmtUtils]: Spent 306ms on a formula simplification that was a NOOP. DAG size: 146 [2018-04-11 20:42:54,846 WARN L148 SmtUtils]: Spent 316ms on a formula simplification that was a NOOP. DAG size: 144 [2018-04-11 20:42:55,343 WARN L148 SmtUtils]: Spent 290ms on a formula simplification that was a NOOP. DAG size: 144 [2018-04-11 20:42:55,948 WARN L148 SmtUtils]: Spent 365ms on a formula simplification that was a NOOP. DAG size: 154 [2018-04-11 20:42:56,314 WARN L148 SmtUtils]: Spent 132ms on a formula simplification that was a NOOP. DAG size: 97 [2018-04-11 20:42:56,628 WARN L148 SmtUtils]: Spent 138ms on a formula simplification that was a NOOP. DAG size: 101 [2018-04-11 20:42:56,905 WARN L148 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 96 [2018-04-11 20:42:57,131 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 91 DAG size of output 78 [2018-04-11 20:42:57,423 WARN L148 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 89 [2018-04-11 20:42:57,838 WARN L148 SmtUtils]: Spent 223ms on a formula simplification that was a NOOP. DAG size: 129 [2018-04-11 20:42:58,279 WARN L148 SmtUtils]: Spent 209ms on a formula simplification that was a NOOP. DAG size: 127 [2018-04-11 20:42:58,705 WARN L148 SmtUtils]: Spent 231ms on a formula simplification that was a NOOP. DAG size: 127 [2018-04-11 20:42:59,188 WARN L148 SmtUtils]: Spent 240ms on a formula simplification that was a NOOP. DAG size: 139 [2018-04-11 20:42:59,814 WARN L148 SmtUtils]: Spent 130ms on a formula simplification that was a NOOP. DAG size: 90 [2018-04-11 20:43:00,274 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 80 DAG size of output 69 [2018-04-11 20:43:00,865 WARN L148 SmtUtils]: Spent 154ms on a formula simplification that was a NOOP. DAG size: 112 [2018-04-11 20:43:01,256 WARN L148 SmtUtils]: Spent 165ms on a formula simplification that was a NOOP. DAG size: 110 [2018-04-11 20:43:01,621 WARN L148 SmtUtils]: Spent 166ms on a formula simplification that was a NOOP. DAG size: 110 [2018-04-11 20:43:02,056 WARN L148 SmtUtils]: Spent 194ms on a formula simplification that was a NOOP. DAG size: 122 [2018-04-11 20:43:03,417 WARN L148 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 95 [2018-04-11 20:43:03,735 WARN L148 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 93 [2018-04-11 20:43:04,018 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 93 [2018-04-11 20:43:04,356 WARN L148 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 105 [2018-04-11 20:43:11,387 WARN L151 SmtUtils]: Spent 1713ms on a formula simplification. DAG size of input: 181 DAG size of output 179 [2018-04-11 20:43:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:43:11,389 INFO L93 Difference]: Finished difference Result 328 states and 338 transitions. [2018-04-11 20:43:11,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-04-11 20:43:11,389 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 156 [2018-04-11 20:43:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:43:11,390 INFO L225 Difference]: With dead ends: 328 [2018-04-11 20:43:11,390 INFO L226 Difference]: Without dead ends: 305 [2018-04-11 20:43:11,392 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11003 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=5623, Invalid=41249, Unknown=0, NotChecked=0, Total=46872 [2018-04-11 20:43:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-11 20:43:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 295. [2018-04-11 20:43:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-04-11 20:43:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 305 transitions. [2018-04-11 20:43:11,410 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 305 transitions. Word has length 156 [2018-04-11 20:43:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:43:11,411 INFO L459 AbstractCegarLoop]: Abstraction has 295 states and 305 transitions. [2018-04-11 20:43:11,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-11 20:43:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 305 transitions. [2018-04-11 20:43:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-04-11 20:43:11,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:43:11,412 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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 20:43:11,412 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:43:11,412 INFO L82 PathProgramCache]: Analyzing trace with hash 333270558, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:43:11,419 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:43:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:43:11,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:43:11,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:43:11,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:43:11,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:43:11,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:43:11,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:43:11,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:43:11,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:43:11,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (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 20:43:11,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:43:11,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:43:11,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:43:11,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (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 20:43:11,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:43:11,557 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 20:43:11,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:43:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:43:12,333 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:43:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:43:14,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:43:14,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 74 [2018-04-11 20:43:14,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-11 20:43:14,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-11 20:43:14,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=5197, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 20:43:14,887 INFO L87 Difference]: Start difference. First operand 295 states and 305 transitions. Second operand 75 states. [2018-04-11 20:43:20,279 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 107 DAG size of output 93 [2018-04-11 20:43:20,601 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 112 DAG size of output 95 [2018-04-11 20:43:20,881 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 109 DAG size of output 92 [2018-04-11 20:43:21,761 WARN L151 SmtUtils]: Spent 453ms on a formula simplification. DAG size of input: 162 DAG size of output 129 [2018-04-11 20:43:22,216 WARN L151 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 163 DAG size of output 98 [2018-04-11 20:43:22,579 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 107 DAG size of output 90 [2018-04-11 20:43:22,932 WARN L151 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 111 DAG size of output 94 [2018-04-11 20:43:23,261 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 106 DAG size of output 89 [2018-04-11 20:43:23,582 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 103 DAG size of output 83 [2018-04-11 20:43:24,412 WARN L151 SmtUtils]: Spent 396ms on a formula simplification. DAG size of input: 155 DAG size of output 116 [2018-04-11 20:43:25,106 WARN L151 SmtUtils]: Spent 462ms on a formula simplification. DAG size of input: 145 DAG size of output 113 [2018-04-11 20:43:25,471 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 91 DAG size of output 78 [2018-04-11 20:43:25,745 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 95 DAG size of output 84 [2018-04-11 20:43:25,969 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 90 DAG size of output 77 [2018-04-11 20:43:26,657 WARN L151 SmtUtils]: Spent 331ms on a formula simplification. DAG size of input: 129 DAG size of output 94 [2018-04-11 20:43:27,119 WARN L151 SmtUtils]: Spent 309ms on a formula simplification. DAG size of input: 123 DAG size of output 95 [2018-04-11 20:43:27,585 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 84 DAG size of output 75 [2018-04-11 20:43:28,008 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 76 DAG size of output 60 [2018-04-11 20:43:28,397 WARN L151 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 112 DAG size of output 81 [2018-04-11 20:43:28,795 WARN L151 SmtUtils]: Spent 263ms on a formula simplification. DAG size of input: 106 DAG size of output 82 [2018-04-11 20:43:29,870 WARN L151 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 95 DAG size of output 68 [2018-04-11 20:43:30,186 WARN L151 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 89 DAG size of output 69 [2018-04-11 20:43:31,073 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 78 DAG size of output 55 [2018-04-11 20:43:31,319 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 72 DAG size of output 56 [2018-04-11 20:43:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:43:33,527 INFO L93 Difference]: Finished difference Result 296 states and 305 transitions. [2018-04-11 20:43:33,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-11 20:43:33,527 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 159 [2018-04-11 20:43:33,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:43:33,528 INFO L225 Difference]: With dead ends: 296 [2018-04-11 20:43:33,528 INFO L226 Difference]: Without dead ends: 295 [2018-04-11 20:43:33,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6153 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=3651, Invalid=27855, Unknown=0, NotChecked=0, Total=31506 [2018-04-11 20:43:33,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-11 20:43:33,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-04-11 20:43:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-04-11 20:43:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 297 transitions. [2018-04-11 20:43:33,561 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 297 transitions. Word has length 159 [2018-04-11 20:43:33,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:43:33,561 INFO L459 AbstractCegarLoop]: Abstraction has 295 states and 297 transitions. [2018-04-11 20:43:33,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-11 20:43:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 297 transitions. [2018-04-11 20:43:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-04-11 20:43:33,563 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:43:33,563 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 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 20:43:33,564 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:43:33,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1736013922, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:43:33,572 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:43:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:43:33,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:43:33,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:43:33,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:43:33,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 6 treesize of output 5 [2018-04-11 20:43:33,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:43:33,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:43:33,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:43:33,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:43:33,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (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 20:43:33,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:43:33,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:43:33,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:43:33,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 20:43:33,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:43:33,783 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 20:43:33,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:43:36,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 1976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:43:36,397 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:43:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 1976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:43:44,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:43:44,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 61] total 129 [2018-04-11 20:43:44,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-04-11 20:43:44,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-04-11 20:43:44,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1109, Invalid=15661, Unknown=0, NotChecked=0, Total=16770 [2018-04-11 20:43:44,245 INFO L87 Difference]: Start difference. First operand 295 states and 297 transitions. Second operand 130 states. [2018-04-11 20:43:47,514 WARN L151 SmtUtils]: Spent 400ms on a formula simplification. DAG size of input: 220 DAG size of output 187 [2018-04-11 20:43:48,445 WARN L151 SmtUtils]: Spent 425ms on a formula simplification. DAG size of input: 220 DAG size of output 183 [2018-04-11 20:43:50,542 WARN L151 SmtUtils]: Spent 439ms on a formula simplification. DAG size of input: 219 DAG size of output 182 [2018-04-11 20:43:52,790 WARN L151 SmtUtils]: Spent 377ms on a formula simplification. DAG size of input: 219 DAG size of output 182 [2018-04-11 20:43:55,114 WARN L151 SmtUtils]: Spent 382ms on a formula simplification. DAG size of input: 219 DAG size of output 182 [2018-04-11 20:43:57,283 WARN L151 SmtUtils]: Spent 377ms on a formula simplification. DAG size of input: 213 DAG size of output 176 [2018-04-11 20:44:09,807 WARN L151 SmtUtils]: Spent 331ms on a formula simplification. DAG size of input: 203 DAG size of output 173 [2018-04-11 20:44:10,632 WARN L151 SmtUtils]: Spent 395ms on a formula simplification. DAG size of input: 208 DAG size of output 175 [2018-04-11 20:44:11,350 WARN L151 SmtUtils]: Spent 373ms on a formula simplification. DAG size of input: 205 DAG size of output 172 [2018-04-11 20:44:13,625 WARN L151 SmtUtils]: Spent 1198ms on a formula simplification. DAG size of input: 306 DAG size of output 241 [2018-04-11 20:44:14,728 WARN L151 SmtUtils]: Spent 538ms on a formula simplification. DAG size of input: 307 DAG size of output 182 [2018-04-11 20:44:15,732 WARN L151 SmtUtils]: Spent 368ms on a formula simplification. DAG size of input: 203 DAG size of output 170 [2018-04-11 20:44:16,641 WARN L151 SmtUtils]: Spent 415ms on a formula simplification. DAG size of input: 207 DAG size of output 178 [2018-04-11 20:44:17,467 WARN L151 SmtUtils]: Spent 352ms on a formula simplification. DAG size of input: 202 DAG size of output 169 [2018-04-11 20:44:18,401 WARN L151 SmtUtils]: Spent 492ms on a formula simplification. DAG size of input: 199 DAG size of output 163 [2018-04-11 20:44:21,193 WARN L151 SmtUtils]: Spent 1529ms on a formula simplification. DAG size of input: 299 DAG size of output 228 [2018-04-11 20:44:22,742 WARN L151 SmtUtils]: Spent 938ms on a formula simplification. DAG size of input: 289 DAG size of output 225 [2018-04-11 20:44:23,828 WARN L151 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 187 DAG size of output 158 [2018-04-11 20:44:24,498 WARN L151 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 191 DAG size of output 164 [2018-04-11 20:44:25,233 WARN L151 SmtUtils]: Spent 301ms on a formula simplification. DAG size of input: 186 DAG size of output 157 [2018-04-11 20:44:26,012 WARN L151 SmtUtils]: Spent 292ms on a formula simplification. DAG size of input: 183 DAG size of output 149 [2018-04-11 20:44:26,660 WARN L151 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 178 DAG size of output 152 [2018-04-11 20:44:27,345 WARN L151 SmtUtils]: Spent 415ms on a formula simplification. DAG size of input: 195 DAG size of output 98 [2018-04-11 20:44:28,521 WARN L151 SmtUtils]: Spent 708ms on a formula simplification. DAG size of input: 273 DAG size of output 206 [2018-04-11 20:44:29,836 WARN L151 SmtUtils]: Spent 733ms on a formula simplification. DAG size of input: 267 DAG size of output 207 [2018-04-11 20:44:30,785 WARN L151 SmtUtils]: Spent 289ms on a formula simplification. DAG size of input: 176 DAG size of output 149 [2018-04-11 20:44:31,455 WARN L151 SmtUtils]: Spent 300ms on a formula simplification. DAG size of input: 180 DAG size of output 155 [2018-04-11 20:44:32,116 WARN L151 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 175 DAG size of output 148 [2018-04-11 20:44:32,716 WARN L151 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 172 DAG size of output 140 [2018-04-11 20:44:33,280 WARN L151 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 167 DAG size of output 143 [2018-04-11 20:44:33,899 WARN L151 SmtUtils]: Spent 379ms on a formula simplification. DAG size of input: 183 DAG size of output 93 [2018-04-11 20:44:35,014 WARN L151 SmtUtils]: Spent 654ms on a formula simplification. DAG size of input: 256 DAG size of output 193 [2018-04-11 20:44:36,223 WARN L151 SmtUtils]: Spent 672ms on a formula simplification. DAG size of input: 250 DAG size of output 194 [2018-04-11 20:44:37,054 WARN L151 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 165 DAG size of output 140 [2018-04-11 20:44:37,701 WARN L151 SmtUtils]: Spent 268ms on a formula simplification. DAG size of input: 169 DAG size of output 146 [2018-04-11 20:44:38,317 WARN L151 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 164 DAG size of output 139 [2018-04-11 20:44:38,929 WARN L151 SmtUtils]: Spent 273ms on a formula simplification. DAG size of input: 161 DAG size of output 131 [2018-04-11 20:44:39,478 WARN L151 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 156 DAG size of output 134 [2018-04-11 20:44:40,028 WARN L151 SmtUtils]: Spent 320ms on a formula simplification. DAG size of input: 171 DAG size of output 88 [2018-04-11 20:44:41,053 WARN L151 SmtUtils]: Spent 585ms on a formula simplification. DAG size of input: 239 DAG size of output 180 [2018-04-11 20:44:42,120 WARN L151 SmtUtils]: Spent 569ms on a formula simplification. DAG size of input: 233 DAG size of output 181 [2018-04-11 20:44:42,925 WARN L151 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 154 DAG size of output 131 [2018-04-11 20:44:43,537 WARN L151 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 158 DAG size of output 137 [2018-04-11 20:44:44,071 WARN L151 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 153 DAG size of output 130 [2018-04-11 20:44:44,619 WARN L151 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 150 DAG size of output 122 [2018-04-11 20:44:45,174 WARN L151 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 145 DAG size of output 125 [2018-04-11 20:44:45,696 WARN L151 SmtUtils]: Spent 298ms on a formula simplification. DAG size of input: 159 DAG size of output 83 [2018-04-11 20:44:46,618 WARN L151 SmtUtils]: Spent 499ms on a formula simplification. DAG size of input: 222 DAG size of output 167 [2018-04-11 20:44:47,655 WARN L151 SmtUtils]: Spent 510ms on a formula simplification. DAG size of input: 216 DAG size of output 168 [2018-04-11 20:44:48,395 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 143 DAG size of output 122 [2018-04-11 20:44:48,920 WARN L151 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 147 DAG size of output 128 [2018-04-11 20:44:49,420 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 142 DAG size of output 121 [2018-04-11 20:44:49,946 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 139 DAG size of output 113 [2018-04-11 20:44:50,441 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 134 DAG size of output 116 [2018-04-11 20:44:50,921 WARN L151 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 147 DAG size of output 78 [2018-04-11 20:44:51,783 WARN L151 SmtUtils]: Spent 454ms on a formula simplification. DAG size of input: 205 DAG size of output 154 [2018-04-11 20:44:52,838 WARN L151 SmtUtils]: Spent 436ms on a formula simplification. DAG size of input: 199 DAG size of output 155 [2018-04-11 20:44:53,546 WARN L151 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 132 DAG size of output 113 [2018-04-11 20:44:54,063 WARN L151 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 136 DAG size of output 119 [2018-04-11 20:44:54,570 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 131 DAG size of output 112 [2018-04-11 20:44:55,077 WARN L151 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 128 DAG size of output 104 [2018-04-11 20:44:55,531 WARN L151 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 123 DAG size of output 107 [2018-04-11 20:44:55,980 WARN L151 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 135 DAG size of output 73 [2018-04-11 20:44:56,770 WARN L151 SmtUtils]: Spent 395ms on a formula simplification. DAG size of input: 188 DAG size of output 141 [2018-04-11 20:44:57,611 WARN L151 SmtUtils]: Spent 384ms on a formula simplification. DAG size of input: 182 DAG size of output 142 [2018-04-11 20:44:58,254 WARN L151 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 121 DAG size of output 104 [2018-04-11 20:44:58,756 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 125 DAG size of output 110 [2018-04-11 20:44:59,183 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 120 DAG size of output 103 [2018-04-11 20:44:59,641 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 117 DAG size of output 95 [2018-04-11 20:45:00,070 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 112 DAG size of output 98 [2018-04-11 20:45:00,491 WARN L151 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 123 DAG size of output 68 [2018-04-11 20:45:01,195 WARN L151 SmtUtils]: Spent 348ms on a formula simplification. DAG size of input: 171 DAG size of output 128 [2018-04-11 20:45:02,000 WARN L151 SmtUtils]: Spent 357ms on a formula simplification. DAG size of input: 165 DAG size of output 129 [2018-04-11 20:45:02,648 WARN L151 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 110 DAG size of output 95 [2018-04-11 20:45:03,126 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 114 DAG size of output 101 [2018-04-11 20:45:03,605 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 109 DAG size of output 94 [2018-04-11 20:45:04,003 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 106 DAG size of output 86 [2018-04-11 20:45:04,413 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 101 DAG size of output 89 [2018-04-11 20:45:04,790 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 111 DAG size of output 63 [2018-04-11 20:45:05,439 WARN L151 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 154 DAG size of output 115 [2018-04-11 20:45:06,163 WARN L151 SmtUtils]: Spent 300ms on a formula simplification. DAG size of input: 148 DAG size of output 116 [2018-04-11 20:45:06,851 WARN L151 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 99 DAG size of output 86 [2018-04-11 20:45:07,482 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 103 DAG size of output 92 [2018-04-11 20:45:07,847 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 98 DAG size of output 85 [2018-04-11 20:45:08,204 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 95 DAG size of output 77 [2018-04-11 20:45:08,897 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 99 DAG size of output 58 [2018-04-11 20:45:09,564 WARN L151 SmtUtils]: Spent 345ms on a formula simplification. DAG size of input: 137 DAG size of output 102 [2018-04-11 20:45:10,294 WARN L151 SmtUtils]: Spent 351ms on a formula simplification. DAG size of input: 131 DAG size of output 103 [2018-04-11 20:45:10,786 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 88 DAG size of output 77 [2018-04-11 20:45:11,227 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 92 DAG size of output 83 [2018-04-11 20:45:12,487 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 87 DAG size of output 53 [2018-04-11 20:45:13,059 WARN L151 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 120 DAG size of output 89 [2018-04-11 20:45:13,667 WARN L151 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 114 DAG size of output 90 [2018-04-11 20:45:14,444 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 81 DAG size of output 74 [2018-04-11 20:45:15,990 WARN L151 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 103 DAG size of output 76 [2018-04-11 20:45:16,493 WARN L151 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 97 DAG size of output 77 [2018-04-11 20:45:18,501 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 86 DAG size of output 63 [2018-04-11 20:45:18,902 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 80 DAG size of output 64 [2018-04-11 20:45:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:45:23,678 INFO L93 Difference]: Finished difference Result 585 states and 616 transitions. [2018-04-11 20:45:23,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2018-04-11 20:45:23,678 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 279 [2018-04-11 20:45:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:45:23,681 INFO L225 Difference]: With dead ends: 585 [2018-04-11 20:45:23,681 INFO L226 Difference]: Without dead ends: 527 [2018-04-11 20:45:23,689 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31975 ImplicationChecksByTransitivity, 101.3s TimeCoverageRelationStatistics Valid=14377, Invalid=122153, Unknown=0, NotChecked=0, Total=136530 [2018-04-11 20:45:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-04-11 20:45:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-04-11 20:45:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-04-11 20:45:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 529 transitions. [2018-04-11 20:45:23,759 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 529 transitions. Word has length 279 [2018-04-11 20:45:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:45:23,760 INFO L459 AbstractCegarLoop]: Abstraction has 527 states and 529 transitions. [2018-04-11 20:45:23,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-04-11 20:45:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 529 transitions. [2018-04-11 20:45:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-04-11 20:45:23,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:45:23,764 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:45:23,764 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:45:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash -524028700, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:45:23,774 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:45:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:45:24,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:45:24,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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 20:45:24,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:45:24,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:45:24,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:45:24,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:45:24,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:45:24,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:45:24,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (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 20:45:24,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:45:24,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:45:24,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:45:24,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (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 20:45:24,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:45:24,123 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 20:45:24,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:45:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7568 backedges. 0 proven. 7568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:45:30,116 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-04-11 20:45:37,480 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 20:45:37,481 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 20:45:37,484 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 20:45:37,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 08:45:37 BoogieIcfgContainer [2018-04-11 20:45:37,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 20:45:37,485 INFO L168 Benchmark]: Toolchain (without parser) took 249616.60 ms. Allocated memory was 305.1 MB in the beginning and 491.8 MB in the end (delta: 186.6 MB). Free memory was 242.6 MB in the beginning and 386.4 MB in the end (delta: -143.8 MB). Peak memory consumption was 184.3 MB. Max. memory is 5.3 GB. [2018-04-11 20:45:37,486 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 305.1 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 20:45:37,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.86 ms. Allocated memory is still 305.1 MB. Free memory was 242.6 MB in the beginning and 218.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. [2018-04-11 20:45:37,487 INFO L168 Benchmark]: Boogie Preprocessor took 57.83 ms. Allocated memory is still 305.1 MB. Free memory was 218.5 MB in the beginning and 215.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-11 20:45:37,487 INFO L168 Benchmark]: RCFGBuilder took 521.81 ms. Allocated memory was 305.1 MB in the beginning and 470.3 MB in the end (delta: 165.2 MB). Free memory was 215.5 MB in the beginning and 402.4 MB in the end (delta: -186.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-04-11 20:45:37,487 INFO L168 Benchmark]: TraceAbstraction took 248679.66 ms. Allocated memory was 470.3 MB in the beginning and 491.8 MB in the end (delta: 21.5 MB). Free memory was 402.4 MB in the beginning and 386.4 MB in the end (delta: 16.0 MB). Peak memory consumption was 179.0 MB. Max. memory is 5.3 GB. [2018-04-11 20:45:37,489 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.26 ms. Allocated memory is still 305.1 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 351.86 ms. Allocated memory is still 305.1 MB. Free memory was 242.6 MB in the beginning and 218.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 57.83 ms. Allocated memory is still 305.1 MB. Free memory was 218.5 MB in the beginning and 215.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 521.81 ms. Allocated memory was 305.1 MB in the beginning and 470.3 MB in the end (delta: 165.2 MB). Free memory was 215.5 MB in the beginning and 402.4 MB in the end (delta: -186.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 248679.66 ms. Allocated memory was 470.3 MB in the beginning and 491.8 MB in the end (delta: 21.5 MB). Free memory was 402.4 MB in the beginning and 386.4 MB in the end (delta: 16.0 MB). Peak memory consumption was 179.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 153 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 153 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 153 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 153 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 153 known predicates. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 153 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 153 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 153 known predicates. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 153 known predicates. - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 153 known predicates. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 153 known predicates. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 153 known predicates. - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 153 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 97 locations, 13 error locations. TIMEOUT Result, 248.6s OverallTime, 40 OverallIterations, 33 TraceHistogramMax, 193.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2904 SDtfs, 19919 SDslu, 36348 SDs, 0 SdLazy, 30862 SolverSat, 3121 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 24.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5656 GetRequests, 3690 SyntacticMatches, 29 SemanticMatches, 1937 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 61193 ImplicationChecksByTransitivity, 198.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=527occurred in iteration=39, 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.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 745 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 38.3s InterpolantComputationTime, 2344 NumberOfCodeBlocks, 2344 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4610 ConstructedInterpolants, 433 QuantifiedInterpolants, 7146041 SizeOfPredicates, 713 NumberOfNonLiveVariables, 7025 ConjunctsInSsa, 1497 ConjunctsInUnsatCore, 78 InterpolantComputations, 46 PerfectInterpolantSequences, 46/6768 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_20-45-37-497.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_20-45-37-497.csv Completed graceful shutdown