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_cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 20:26:47,365 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 20:26:47,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 20:26:47,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 20:26:47,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 20:26:47,381 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 20:26:47,382 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 20:26:47,384 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 20:26:47,386 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 20:26:47,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 20:26:47,388 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 20:26:47,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 20:26:47,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 20:26:47,390 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 20:26:47,390 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 20:26:47,392 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 20:26:47,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 20:26:47,396 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 20:26:47,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 20:26:47,398 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 20:26:47,401 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 20:26:47,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 20:26:47,401 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 20:26:47,402 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 20:26:47,403 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 20:26:47,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 20:26:47,405 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 20:26:47,405 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 20:26:47,406 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 20:26:47,406 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 20:26:47,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 20:26:47,407 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-09 20:26:47,432 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 20:26:47,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 20:26:47,433 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 20:26:47,433 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 20:26:47,434 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 20:26:47,434 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 20:26:47,435 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 20:26:47,435 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 20:26:47,435 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 20:26:47,435 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 20:26:47,436 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 20:26:47,436 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 20:26:47,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 20:26:47,436 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 20:26:47,436 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 20:26:47,437 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 20:26:47,437 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 20:26:47,437 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 20:26:47,437 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 20:26:47,437 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 20:26:47,438 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 20:26:47,438 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 20:26:47,438 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 20:26:47,438 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 20:26:47,438 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 20:26:47,439 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 20:26:47,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 20:26:47,439 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 20:26:47,439 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 20:26:47,439 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 20:26:47,440 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 20:26:47,440 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 20:26:47,440 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:26:47,440 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 20:26:47,441 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 20:26:47,441 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 20:26:47,441 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 20:26:47,442 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 20:26:47,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 20:26:47,489 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 20:26:47,493 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 20:26:47,494 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 20:26:47,495 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 20:26:47,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:47,831 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG25bc7fc0b [2018-04-09 20:26:48,014 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 20:26:48,014 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 20:26:48,015 INFO L168 CDTParser]: Scanning openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,025 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 20:26:48,025 INFO L215 ultiparseSymbolTable]: [2018-04-09 20:26:48,025 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 20:26:48,026 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,026 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,026 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,026 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncat ('cstrncat') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,026 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 20:26:48,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,038 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,038 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,038 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,038 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,038 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,038 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,038 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,038 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,056 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG25bc7fc0b [2018-04-09 20:26:48,061 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 20:26:48,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 20:26:48,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 20:26:48,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 20:26:48,069 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 20:26:48,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 08:26:48" (1/1) ... [2018-04-09 20:26:48,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70398815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:26:48, skipping insertion in model container [2018-04-09 20:26:48,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 08:26:48" (1/1) ... [2018-04-09 20:26:48,085 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 20:26:48,114 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 20:26:48,282 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 20:26:48,334 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 20:26:48,342 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-09 20:26:48,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:26:48 WrapperNode [2018-04-09 20:26:48,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 20:26:48,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 20:26:48,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 20:26:48,381 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 20:26:48,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:26:48" (1/1) ... [2018-04-09 20:26:48,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:26:48" (1/1) ... [2018-04-09 20:26:48,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:26:48" (1/1) ... [2018-04-09 20:26:48,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:26:48" (1/1) ... [2018-04-09 20:26:48,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:26:48" (1/1) ... [2018-04-09 20:26:48,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:26:48" (1/1) ... [2018-04-09 20:26:48,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:26:48" (1/1) ... [2018-04-09 20:26:48,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 20:26:48,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 20:26:48,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 20:26:48,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 20:26:48,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:26:48" (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-09 20:26:48,580 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 20:26:48,580 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 20:26:48,580 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 20:26:48,580 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 20:26:48,580 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncat [2018-04-09 20:26:48,580 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 20:26:48,581 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 20:26:48,581 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 20:26:48,581 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 20:26:48,581 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 20:26:48,581 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 20:26:48,581 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 20:26:48,581 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 20:26:48,581 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 20:26:48,581 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 20:26:48,582 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 20:26:48,582 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 20:26:48,582 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 20:26:48,582 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 20:26:48,582 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 20:26:48,583 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 20:26:48,583 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 20:26:48,583 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 20:26:48,583 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 20:26:48,583 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 20:26:48,583 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 20:26:48,583 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 20:26:48,583 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 20:26:48,583 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 20:26:48,584 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 20:26:48,584 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 20:26:48,584 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 20:26:48,584 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 20:26:48,584 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 20:26:48,584 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 20:26:48,584 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 20:26:48,584 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 20:26:48,584 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 20:26:48,584 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 20:26:48,584 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 20:26:48,585 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 20:26:48,585 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 20:26:48,585 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 20:26:48,585 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 20:26:48,585 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 20:26:48,585 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 20:26:48,585 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 20:26:48,586 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 20:26:48,586 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 20:26:48,586 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 20:26:48,586 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 20:26:48,586 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 20:26:48,586 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 20:26:48,586 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 20:26:48,586 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 20:26:48,586 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 20:26:48,586 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 20:26:48,586 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 20:26:48,586 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 20:26:48,587 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 20:26:48,587 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 20:26:48,587 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 20:26:48,587 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 20:26:48,587 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 20:26:48,587 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 20:26:48,587 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 20:26:48,587 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 20:26:48,587 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 20:26:48,587 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 20:26:48,587 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 20:26:48,587 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 20:26:48,588 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 20:26:48,588 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 20:26:48,588 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 20:26:48,588 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 20:26:48,588 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 20:26:48,588 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 20:26:48,588 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 20:26:48,588 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 20:26:48,588 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 20:26:48,588 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 20:26:48,588 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 20:26:48,588 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 20:26:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 20:26:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 20:26:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 20:26:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 20:26:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 20:26:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 20:26:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 20:26:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 20:26:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 20:26:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 20:26:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 20:26:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 20:26:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 20:26:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 20:26:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 20:26:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 20:26:48,591 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 20:26:48,591 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 20:26:48,591 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 20:26:48,591 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 20:26:48,591 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 20:26:48,591 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 20:26:48,591 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 20:26:48,591 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 20:26:48,592 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 20:26:48,592 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 20:26:48,592 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncat [2018-04-09 20:26:48,592 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 20:26:48,592 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 20:26:48,592 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 20:26:48,592 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 20:26:48,593 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 20:26:48,593 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 20:26:48,593 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 20:26:48,593 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 20:26:48,961 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 20:26:48,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 08:26:48 BoogieIcfgContainer [2018-04-09 20:26:48,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 20:26:48,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 20:26:48,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 20:26:48,966 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 20:26:48,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 08:26:48" (1/3) ... [2018-04-09 20:26:48,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dad4ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 08:26:48, skipping insertion in model container [2018-04-09 20:26:48,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:26:48" (2/3) ... [2018-04-09 20:26:48,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dad4ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 08:26:48, skipping insertion in model container [2018-04-09 20:26:48,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 08:26:48" (3/3) ... [2018-04-09 20:26:48,969 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:26:48,979 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 20:26:48,987 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-04-09 20:26:49,035 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 20:26:49,035 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 20:26:49,036 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 20:26:49,036 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 20:26:49,036 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 20:26:49,036 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 20:26:49,036 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 20:26:49,036 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 20:26:49,036 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 20:26:49,037 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 20:26:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-04-09 20:26:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 20:26:49,056 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:49,057 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] [2018-04-09 20:26:49,057 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:49,060 INFO L82 PathProgramCache]: Analyzing trace with hash 44265951, 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-09 20:26:49,078 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:49,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:49,148 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-09 20:26:49,148 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:49,162 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-09 20:26:49,186 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:49,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 20:26:49,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 20:26:49,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 20:26:49,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:26:49,200 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2018-04-09 20:26:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:49,298 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-04-09 20:26:49,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 20:26:49,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-04-09 20:26:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:49,313 INFO L225 Difference]: With dead ends: 129 [2018-04-09 20:26:49,313 INFO L226 Difference]: Without dead ends: 85 [2018-04-09 20:26:49,317 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:26:49,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-09 20:26:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-04-09 20:26:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-09 20:26:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-04-09 20:26:49,359 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 21 [2018-04-09 20:26:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:49,359 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-04-09 20:26:49,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 20:26:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-04-09 20:26:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-09 20:26:49,360 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:49,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] [2018-04-09 20:26:49,360 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:49,360 INFO L82 PathProgramCache]: Analyzing trace with hash 230705453, 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-09 20:26:49,366 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:49,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:49,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:26:49,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:49,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:49,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:26:49,464 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-09 20:26:49,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:49,471 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-09 20:26:49,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-09 20:26:49,489 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-09 20:26:49,489 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:49,509 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-09 20:26:49,534 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:49,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:26:49,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 20:26:49,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 20:26:49,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 20:26:49,537 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 4 states. [2018-04-09 20:26:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:49,640 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-04-09 20:26:49,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 20:26:49,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-04-09 20:26:49,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:49,642 INFO L225 Difference]: With dead ends: 85 [2018-04-09 20:26:49,642 INFO L226 Difference]: Without dead ends: 84 [2018-04-09 20:26:49,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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-09 20:26:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-09 20:26:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-09 20:26:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-09 20:26:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-04-09 20:26:49,653 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 24 [2018-04-09 20:26:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:49,654 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-04-09 20:26:49,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 20:26:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-04-09 20:26:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-09 20:26:49,655 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:49,655 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:26:49,655 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:49,655 INFO L82 PathProgramCache]: Analyzing trace with hash 230705454, 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-09 20:26:49,662 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:49,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:49,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:26:49,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:49,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:26:49,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:49,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:49,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-09 20:26:49,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:49,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:49,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-09 20:26:49,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:49,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:49,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:49,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:26:49,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:49,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:26:49,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:24 [2018-04-09 20:26:50,010 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-09 20:26:50,010 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:50,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-04-09 20:26:50,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:50,216 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-09 20:26:50,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2018-04-09 20:26:50,285 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:50,298 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:50,327 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-09 20:26:50,327 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:9 [2018-04-09 20:26:50,420 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-09 20:26:50,447 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:50,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2018-04-09 20:26:50,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 20:26:50,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 20:26:50,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-04-09 20:26:50,448 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 13 states. [2018-04-09 20:26:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:50,654 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-04-09 20:26:50,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 20:26:50,655 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-04-09 20:26:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:50,656 INFO L225 Difference]: With dead ends: 84 [2018-04-09 20:26:50,656 INFO L226 Difference]: Without dead ends: 83 [2018-04-09 20:26:50,657 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-04-09 20:26:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-09 20:26:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-09 20:26:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-09 20:26:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-04-09 20:26:50,664 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 24 [2018-04-09 20:26:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:50,665 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-04-09 20:26:50,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 20:26:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-04-09 20:26:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 20:26:50,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:50,666 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:26:50,667 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:50,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1438065452, 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-09 20:26:50,681 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:50,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:50,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:26:50,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:50,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:50,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-09 20:26:50,741 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-09 20:26:50,741 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:50,767 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-09 20:26:50,788 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:50,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-09 20:26:50,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 20:26:50,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 20:26:50,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:26:50,790 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 7 states. [2018-04-09 20:26:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:50,865 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-04-09 20:26:50,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:26:50,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-04-09 20:26:50,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:50,866 INFO L225 Difference]: With dead ends: 83 [2018-04-09 20:26:50,866 INFO L226 Difference]: Without dead ends: 82 [2018-04-09 20:26:50,866 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 20:26:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-09 20:26:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-04-09 20:26:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-09 20:26:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-04-09 20:26:50,872 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 25 [2018-04-09 20:26:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:50,872 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-04-09 20:26:50,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 20:26:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-04-09 20:26:50,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 20:26:50,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:50,873 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:26:50,873 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:50,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1438065453, 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-09 20:26:50,883 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:50,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:50,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:26:50,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:50,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:50,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:26:50,912 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-09 20:26:50,913 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:26:50,954 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:50,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:26:50,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 20:26:50,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 20:26:50,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 20:26:50,955 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 4 states. [2018-04-09 20:26:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:50,997 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-04-09 20:26:50,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 20:26:50,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-09 20:26:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:50,998 INFO L225 Difference]: With dead ends: 82 [2018-04-09 20:26:50,998 INFO L226 Difference]: Without dead ends: 81 [2018-04-09 20:26:50,999 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-09 20:26:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-09 20:26:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-04-09 20:26:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-09 20:26:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-04-09 20:26:51,004 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 25 [2018-04-09 20:26:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:51,004 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-04-09 20:26:51,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 20:26:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-04-09 20:26:51,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 20:26:51,005 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:51,005 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-09 20:26:51,006 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:51,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1704017821, 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-09 20:26:51,012 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:51,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:51,056 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-09 20:26:51,057 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:51,064 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-09 20:26:51,085 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:51,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 20:26:51,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 20:26:51,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 20:26:51,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-09 20:26:51,086 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2018-04-09 20:26:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:51,217 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-04-09 20:26:51,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:26:51,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-09 20:26:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:51,221 INFO L225 Difference]: With dead ends: 100 [2018-04-09 20:26:51,221 INFO L226 Difference]: Without dead ends: 97 [2018-04-09 20:26:51,222 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 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-09 20:26:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-09 20:26:51,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2018-04-09 20:26:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-09 20:26:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-04-09 20:26:51,229 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 34 [2018-04-09 20:26:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:51,229 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-04-09 20:26:51,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 20:26:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-04-09 20:26:51,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 20:26:51,230 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:51,230 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-09 20:26:51,230 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:51,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1704017820, 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-09 20:26:51,238 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:51,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:51,312 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-09 20:26:51,312 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:51,320 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 18 treesize of output 14 [2018-04-09 20:26:51,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:51,329 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 14 treesize of output 12 [2018-04-09 20:26:51,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:51,332 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-09 20:26:51,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-04-09 20:26:51,356 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-09 20:26:51,377 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:51,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-04-09 20:26:51,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 20:26:51,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 20:26:51,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-09 20:26:51,378 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 10 states. [2018-04-09 20:26:51,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:51,556 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-04-09 20:26:51,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:26:51,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-04-09 20:26:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:51,557 INFO L225 Difference]: With dead ends: 97 [2018-04-09 20:26:51,557 INFO L226 Difference]: Without dead ends: 94 [2018-04-09 20:26:51,557 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-04-09 20:26:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-09 20:26:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-04-09 20:26:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-09 20:26:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-04-09 20:26:51,565 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 34 [2018-04-09 20:26:51,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:51,565 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-04-09 20:26:51,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 20:26:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-04-09 20:26:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 20:26:51,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:51,567 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] [2018-04-09 20:26:51,567 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:51,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1346865018, 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-09 20:26:51,573 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:51,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:51,626 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-09 20:26:51,627 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:51,632 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-09 20:26:51,653 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:51,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-09 20:26:51,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 20:26:51,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 20:26:51,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:26:51,654 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 7 states. [2018-04-09 20:26:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:51,724 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2018-04-09 20:26:51,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 20:26:51,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-04-09 20:26:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:51,725 INFO L225 Difference]: With dead ends: 92 [2018-04-09 20:26:51,725 INFO L226 Difference]: Without dead ends: 91 [2018-04-09 20:26:51,725 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 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-09 20:26:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-09 20:26:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-04-09 20:26:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-09 20:26:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-04-09 20:26:51,733 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 40 [2018-04-09 20:26:51,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:51,733 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-04-09 20:26:51,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 20:26:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-04-09 20:26:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 20:26:51,734 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:51,735 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] [2018-04-09 20:26:51,735 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:51,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1346865017, 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-09 20:26:51,749 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:51,769 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:51,835 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-09 20:26:51,835 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:51,844 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-09 20:26:51,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:51,851 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-09 20:26:51,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:51,853 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-09 20:26:51,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-09 20:26:51,870 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-09 20:26:51,891 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:51,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-04-09 20:26:51,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 20:26:51,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 20:26:51,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-09 20:26:51,892 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2018-04-09 20:26:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:52,071 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-04-09 20:26:52,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 20:26:52,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-04-09 20:26:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:52,073 INFO L225 Difference]: With dead ends: 89 [2018-04-09 20:26:52,073 INFO L226 Difference]: Without dead ends: 88 [2018-04-09 20:26:52,073 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 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-09 20:26:52,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-09 20:26:52,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-04-09 20:26:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-09 20:26:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-09 20:26:52,080 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 40 [2018-04-09 20:26:52,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:52,081 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-09 20:26:52,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 20:26:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-09 20:26:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 20:26:52,082 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:52,082 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] [2018-04-09 20:26:52,082 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:52,083 INFO L82 PathProgramCache]: Analyzing trace with hash -509407784, 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-09 20:26:52,097 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:52,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:52,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:52,156 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-09 20:26:52,158 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-09 20:26:52,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:52,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:52,165 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-09 20:26:52,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:26:52,202 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc11.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc11.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc12.base| 1) |main_#t~malloc11.base| 0)) (= (select .cse0 |c_main_#t~malloc12.base|) 0)))) is different from true [2018-04-09 20:26:52,208 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc11.base| 1))) (and (= |c_#valid| (store (store (store .cse0 |main_#t~malloc12.base| 1) |main_#t~malloc11.base| 0) |main_#t~malloc12.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc11.base|)) (= (select .cse0 |main_#t~malloc12.base|) 0)))) is different from true [2018-04-09 20:26:52,214 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-09 20:26:52,214 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:52,238 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc12.base_12| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc12.base_12| 1) |c_main_#t~malloc11.base| 0) |v_main_#t~malloc12.base_12| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_12|))))) is different from false [2018-04-09 20:26:52,249 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc12.base_12| Int) (|v_main_#t~malloc11.base_11| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc11.base_11| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc12.base_12| 1) |v_main_#t~malloc11.base_11| 0) |v_main_#t~malloc12.base_12| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc12.base_12|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_11|)))))) is different from false [2018-04-09 20:26:52,296 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-09 20:26:52,318 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:52,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:26:52,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:26:52,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:26:52,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:26:52,320 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 12 states. [2018-04-09 20:26:52,334 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc12.base_12| Int) (|v_main_#t~malloc11.base_11| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc11.base_11| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc12.base_12| 1) |v_main_#t~malloc11.base_11| 0) |v_main_#t~malloc12.base_12| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc12.base_12|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_11|))))))) is different from false [2018-04-09 20:26:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:52,737 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2018-04-09 20:26:52,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:26:52,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-04-09 20:26:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:52,739 INFO L225 Difference]: With dead ends: 157 [2018-04-09 20:26:52,739 INFO L226 Difference]: Without dead ends: 143 [2018-04-09 20:26:52,740 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 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-09 20:26:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-09 20:26:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2018-04-09 20:26:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-09 20:26:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2018-04-09 20:26:52,750 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 40 [2018-04-09 20:26:52,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:52,751 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2018-04-09 20:26:52,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:26:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2018-04-09 20:26:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-09 20:26:52,752 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:52,752 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] [2018-04-09 20:26:52,753 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:52,753 INFO L82 PathProgramCache]: Analyzing trace with hash 570993852, 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-09 20:26:52,761 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:52,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:52,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:52,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 20:26:52,826 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-09 20:26:52,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:52,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:52,837 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-09 20:26:52,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:26:52,879 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc11.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc11.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc12.base| 1) |main_#t~malloc11.base| 0)) (= (select .cse0 |c_main_#t~malloc12.base|) 0)))) is different from true [2018-04-09 20:26:52,886 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc11.base| 1))) (and (= |c_#valid| (store (store (store .cse0 |main_#t~malloc12.base| 1) |main_#t~malloc11.base| 0) |main_#t~malloc12.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc11.base|)) (= (select .cse0 |main_#t~malloc12.base|) 0)))) is different from true [2018-04-09 20:26:52,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-09 20:26:52,891 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:52,908 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc12.base_14| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc12.base_14| 1) |c_main_#t~malloc11.base| 0) |v_main_#t~malloc12.base_14| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_14|))))) is different from false [2018-04-09 20:26:52,912 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_13| Int) (|v_main_#t~malloc12.base_14| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc11.base_13| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc12.base_14|))) (= (store (store (store .cse0 |v_main_#t~malloc12.base_14| 1) |v_main_#t~malloc11.base_13| 0) |v_main_#t~malloc12.base_14| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_13|)))))) is different from false [2018-04-09 20:26:52,948 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-09 20:26:52,970 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:52,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:26:52,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:26:52,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:26:52,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:26:52,971 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand 12 states. [2018-04-09 20:26:52,981 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_13| Int) (|v_main_#t~malloc12.base_14| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc11.base_13| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc12.base_14|))) (= (store (store (store .cse0 |v_main_#t~malloc12.base_14| 1) |v_main_#t~malloc11.base_13| 0) |v_main_#t~malloc12.base_14| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_13|))))))) is different from false [2018-04-09 20:26:53,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:53,368 INFO L93 Difference]: Finished difference Result 205 states and 225 transitions. [2018-04-09 20:26:53,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:26:53,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-04-09 20:26:53,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:53,370 INFO L225 Difference]: With dead ends: 205 [2018-04-09 20:26:53,370 INFO L226 Difference]: Without dead ends: 191 [2018-04-09 20:26:53,370 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 71 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-09 20:26:53,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-09 20:26:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 137. [2018-04-09 20:26:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-09 20:26:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2018-04-09 20:26:53,378 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 41 [2018-04-09 20:26:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:53,379 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2018-04-09 20:26:53,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:26:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2018-04-09 20:26:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-09 20:26:53,380 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:53,380 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:26:53,380 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:53,380 INFO L82 PathProgramCache]: Analyzing trace with hash -357346301, 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-09 20:26:53,392 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:53,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 20:26:53,425 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 20:26:53,450 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:53,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-09 20:26:53,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 20:26:53,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 20:26:53,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:26:53,451 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand 7 states. [2018-04-09 20:26:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:53,563 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2018-04-09 20:26:53,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 20:26:53,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-04-09 20:26:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:53,564 INFO L225 Difference]: With dead ends: 140 [2018-04-09 20:26:53,564 INFO L226 Difference]: Without dead ends: 139 [2018-04-09 20:26:53,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 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-09 20:26:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-09 20:26:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-04-09 20:26:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-09 20:26:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2018-04-09 20:26:53,572 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 41 [2018-04-09 20:26:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:53,573 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2018-04-09 20:26:53,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 20:26:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2018-04-09 20:26:53,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-09 20:26:53,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:53,574 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:26:53,574 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:53,574 INFO L82 PathProgramCache]: Analyzing trace with hash -357346300, 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-09 20:26:53,583 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:53,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:53,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:26:53,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:53,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-09 20:26:53,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:53,654 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-09 20:26:53,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-09 20:26:53,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:53,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:53,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 20:26:53,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:53,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:53,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:53,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:26:53,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:53,698 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-09 20:26:53,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-04-09 20:26:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:26:53,797 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:53,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-04-09 20:26:53,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:53,969 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-09 20:26:53,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:26:53,978 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:53,979 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 20:26:53,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:53,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:53,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:53,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:21, output treesize:3 [2018-04-09 20:26:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:26:54,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:26:54,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-04-09 20:26:54,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-09 20:26:54,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-09 20:26:54,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-04-09 20:26:54,038 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand 24 states. [2018-04-09 20:26:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:54,574 INFO L93 Difference]: Finished difference Result 218 states and 240 transitions. [2018-04-09 20:26:54,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-09 20:26:54,574 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2018-04-09 20:26:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:54,575 INFO L225 Difference]: With dead ends: 218 [2018-04-09 20:26:54,575 INFO L226 Difference]: Without dead ends: 217 [2018-04-09 20:26:54,576 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2018-04-09 20:26:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-09 20:26:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 150. [2018-04-09 20:26:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-09 20:26:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2018-04-09 20:26:54,590 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 41 [2018-04-09 20:26:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:54,590 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2018-04-09 20:26:54,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-09 20:26:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2018-04-09 20:26:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-09 20:26:54,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:54,591 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] [2018-04-09 20:26:54,591 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:54,592 INFO L82 PathProgramCache]: Analyzing trace with hash 37730935, 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-09 20:26:54,599 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:54,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:54,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:54,638 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-09 20:26:54,640 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-09 20:26:54,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:54,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:54,647 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-09 20:26:54,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:26:54,668 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc11.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc11.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc12.base| 1) |main_#t~malloc11.base| 0)) (= (select .cse0 |c_main_#t~malloc12.base|) 0)))) is different from true [2018-04-09 20:26:54,672 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc11.base| 1))) (and (= |c_#valid| (store (store (store .cse0 |main_#t~malloc12.base| 1) |main_#t~malloc11.base| 0) |main_#t~malloc12.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc11.base|)) (= (select .cse0 |main_#t~malloc12.base|) 0)))) is different from true [2018-04-09 20:26:54,716 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-09 20:26:54,716 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:54,732 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc12.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_17|))) (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc12.base_17| 1) |c_main_#t~malloc11.base| 0) |v_main_#t~malloc12.base_17| 0)))) is different from false [2018-04-09 20:26:54,736 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_16| Int) (|v_main_#t~malloc12.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc11.base_16| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_16|))) (= (store (store (store .cse0 |v_main_#t~malloc12.base_17| 1) |v_main_#t~malloc11.base_16| 0) |v_main_#t~malloc12.base_17| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc12.base_17|) 0))))) is different from false [2018-04-09 20:26:54,766 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-09 20:26:54,790 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:54,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:26:54,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:26:54,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:26:54,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:26:54,791 INFO L87 Difference]: Start difference. First operand 150 states and 167 transitions. Second operand 12 states. [2018-04-09 20:26:54,799 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_16| Int) (|v_main_#t~malloc12.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc11.base_16| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_16|))) (= (store (store (store .cse0 |v_main_#t~malloc12.base_17| 1) |v_main_#t~malloc11.base_16| 0) |v_main_#t~malloc12.base_17| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc12.base_17|) 0)))))) is different from false [2018-04-09 20:26:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:55,162 INFO L93 Difference]: Finished difference Result 225 states and 247 transitions. [2018-04-09 20:26:55,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:26:55,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-04-09 20:26:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:55,163 INFO L225 Difference]: With dead ends: 225 [2018-04-09 20:26:55,163 INFO L226 Difference]: Without dead ends: 211 [2018-04-09 20:26:55,164 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 71 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-09 20:26:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-09 20:26:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 152. [2018-04-09 20:26:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-09 20:26:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 170 transitions. [2018-04-09 20:26:55,174 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 170 transitions. Word has length 41 [2018-04-09 20:26:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:55,175 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 170 transitions. [2018-04-09 20:26:55,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:26:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 170 transitions. [2018-04-09 20:26:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-09 20:26:55,176 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:55,176 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] [2018-04-09 20:26:55,176 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:55,176 INFO L82 PathProgramCache]: Analyzing trace with hash -77724905, 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-09 20:26:55,183 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:55,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:55,208 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-09 20:26:55,209 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:26:55,243 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:55,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-04-09 20:26:55,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 20:26:55,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 20:26:55,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:26:55,243 INFO L87 Difference]: Start difference. First operand 152 states and 170 transitions. Second operand 7 states. [2018-04-09 20:26:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:55,277 INFO L93 Difference]: Finished difference Result 226 states and 248 transitions. [2018-04-09 20:26:55,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 20:26:55,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-04-09 20:26:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:55,278 INFO L225 Difference]: With dead ends: 226 [2018-04-09 20:26:55,278 INFO L226 Difference]: Without dead ends: 148 [2018-04-09 20:26:55,279 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:26:55,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-09 20:26:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-04-09 20:26:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-09 20:26:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 163 transitions. [2018-04-09 20:26:55,290 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 163 transitions. Word has length 41 [2018-04-09 20:26:55,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:55,291 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 163 transitions. [2018-04-09 20:26:55,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 20:26:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 163 transitions. [2018-04-09 20:26:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-09 20:26:55,291 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:55,291 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] [2018-04-09 20:26:55,292 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash -829556717, 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-09 20:26:55,300 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:55,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:55,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:55,347 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-09 20:26:55,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:55,350 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-09 20:26:55,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:55,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:55,358 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-09 20:26:55,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:26:55,376 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc11.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc11.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc12.base| 1) |main_#t~malloc11.base| 0)) (= (select .cse0 |c_main_#t~malloc12.base|) 0)))) is different from true [2018-04-09 20:26:55,380 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc11.base| 1))) (and (= |c_#valid| (store (store (store .cse0 |main_#t~malloc12.base| 1) |main_#t~malloc11.base| 0) |main_#t~malloc12.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc11.base|)) (= (select .cse0 |main_#t~malloc12.base|) 0)))) is different from true [2018-04-09 20:26:55,384 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-09 20:26:55,384 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:55,420 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc12.base_21| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc12.base_21| 1) |c_main_#t~malloc11.base| 0) |v_main_#t~malloc12.base_21| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_21|))))) is different from false [2018-04-09 20:26:55,423 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc12.base_21| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc11.base_20| 1))) (or (not (= (select .cse0 |v_main_#t~malloc12.base_21|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_20|))) (= (store (store (store .cse0 |v_main_#t~malloc12.base_21| 1) |v_main_#t~malloc11.base_20| 0) |v_main_#t~malloc12.base_21| 0) |c_old(#valid)|)))) is different from false [2018-04-09 20:26:55,447 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-09 20:26:55,479 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:26:55,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:26:55,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:26:55,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:26:55,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:26:55,480 INFO L87 Difference]: Start difference. First operand 148 states and 163 transitions. Second operand 12 states. [2018-04-09 20:26:55,503 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc12.base_21| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc11.base_20| 1))) (or (not (= (select .cse0 |v_main_#t~malloc12.base_21|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_20|))) (= (store (store (store .cse0 |v_main_#t~malloc12.base_21| 1) |v_main_#t~malloc11.base_20| 0) |v_main_#t~malloc12.base_21| 0) |c_old(#valid)|))))) is different from false [2018-04-09 20:26:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:26:55,804 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-04-09 20:26:55,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:26:55,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-04-09 20:26:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:26:55,805 INFO L225 Difference]: With dead ends: 154 [2018-04-09 20:26:55,805 INFO L226 Difference]: Without dead ends: 140 [2018-04-09 20:26:55,806 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 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-09 20:26:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-09 20:26:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 79. [2018-04-09 20:26:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-09 20:26:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-04-09 20:26:55,815 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 42 [2018-04-09 20:26:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:26:55,815 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-04-09 20:26:55,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:26:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-04-09 20:26:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-09 20:26:55,816 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:26:55,816 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-04-09 20:26:55,817 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:26:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1083216796, now seen corresponding path program 2 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-09 20:26:55,825 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:26:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:26:55,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:26:55,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:26:55,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:55,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:55,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-09 20:26:55,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:55,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:55,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:26:55,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:55,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:55,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-04-09 20:26:55,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-04-09 20:26:55,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 20:26:55,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:55,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:55,917 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-09 20:26:55,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-04-09 20:26:55,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-09 20:26:55,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:26:55,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:55,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:55,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-09 20:26:55,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:49, output treesize:45 [2018-04-09 20:26:56,273 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 41 treesize of output 37 [2018-04-09 20:26:56,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 20:26:56,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:56,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:26:56,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-04-09 20:26:56,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 20:26:56,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:26:56,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:26:56,317 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:70, output treesize:43 [2018-04-09 20:26:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:26:56,427 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:26:56,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-09 20:26:56,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:56,895 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 35 treesize of output 31 [2018-04-09 20:26:56,919 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:26:56,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 20:26:56,922 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:26:56,926 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:56,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:26:56,933 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:58, output treesize:14 [2018-04-09 20:26:57,003 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-09 20:26:57,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:26:57,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2018-04-09 20:26:57,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-09 20:26:57,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-09 20:26:57,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2018-04-09 20:26:57,025 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 35 states. [2018-04-09 20:27:07,748 WARN L151 SmtUtils]: Spent 1225ms on a formula simplification. DAG size of input: 83 DAG size of output 69 [2018-04-09 20:27:10,483 WARN L151 SmtUtils]: Spent 604ms on a formula simplification. DAG size of input: 79 DAG size of output 71 [2018-04-09 20:27:18,711 WARN L151 SmtUtils]: Spent 8092ms on a formula simplification. DAG size of input: 97 DAG size of output 90 [2018-04-09 20:27:27,795 WARN L151 SmtUtils]: Spent 654ms on a formula simplification. DAG size of input: 84 DAG size of output 70 [2018-04-09 20:27:30,489 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 82 DAG size of output 72 [2018-04-09 20:27:32,652 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 80 DAG size of output 70 [2018-04-09 20:27:40,831 WARN L151 SmtUtils]: Spent 8113ms on a formula simplification. DAG size of input: 100 DAG size of output 91 [2018-04-09 20:27:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:27:41,117 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-04-09 20:27:41,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-09 20:27:41,118 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 48 [2018-04-09 20:27:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:27:41,118 INFO L225 Difference]: With dead ends: 100 [2018-04-09 20:27:41,118 INFO L226 Difference]: Without dead ends: 99 [2018-04-09 20:27:41,119 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=573, Invalid=2842, Unknown=7, NotChecked=0, Total=3422 [2018-04-09 20:27:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-09 20:27:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 69. [2018-04-09 20:27:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-09 20:27:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-04-09 20:27:41,124 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 48 [2018-04-09 20:27:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:27:41,124 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-04-09 20:27:41,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-09 20:27:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-04-09 20:27:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-09 20:27:41,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:27:41,124 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] [2018-04-09 20:27:41,124 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:27:41,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1366398051, 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-09 20:27:41,130 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:27:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:27:41,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:27:41,165 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-09 20:27:41,165 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:27:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:27:41,191 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:27:41,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-09 20:27:41,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 20:27:41,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 20:27:41,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:27:41,193 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 7 states. [2018-04-09 20:27:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:27:41,244 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-04-09 20:27:41,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 20:27:41,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-04-09 20:27:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:27:41,245 INFO L225 Difference]: With dead ends: 71 [2018-04-09 20:27:41,245 INFO L226 Difference]: Without dead ends: 69 [2018-04-09 20:27:41,246 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 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-09 20:27:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-04-09 20:27:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-04-09 20:27:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-09 20:27:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-04-09 20:27:41,253 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 52 [2018-04-09 20:27:41,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:27:41,254 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-04-09 20:27:41,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 20:27:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-04-09 20:27:41,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-09 20:27:41,254 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:27:41,255 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] [2018-04-09 20:27:41,255 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:27:41,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1366398050, now seen corresponding path program 1 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-09 20:27:41,261 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:27:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:27:41,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:27:41,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:27:41,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:41,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:27:41,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:41,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:41,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-09 20:27:41,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:41,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:41,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 20:27:41,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:41,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:41,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:41,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:27:41,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:41,352 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-09 20:27:41,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-04-09 20:27:41,445 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-09 20:27:41,445 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:27:43,277 WARN L148 SmtUtils]: Spent 1633ms on a formula simplification that was a NOOP. DAG size: 27 [2018-04-09 20:27:43,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-04-09 20:27:43,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:43,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09 20:27:43,297 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 20:27:43,297 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:43,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:27:43,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:43,301 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:43,303 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-09 20:27:43,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:21, output treesize:3 [2018-04-09 20:27:43,346 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-09 20:27:43,380 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:27:43,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 12] imperfect sequences [] total 23 [2018-04-09 20:27:43,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-09 20:27:43,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-09 20:27:43,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-04-09 20:27:43,381 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 24 states. [2018-04-09 20:27:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:27:43,766 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-04-09 20:27:43,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 20:27:43,766 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-04-09 20:27:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:27:43,767 INFO L225 Difference]: With dead ends: 104 [2018-04-09 20:27:43,767 INFO L226 Difference]: Without dead ends: 100 [2018-04-09 20:27:43,767 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2018-04-09 20:27:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-09 20:27:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2018-04-09 20:27:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-09 20:27:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-04-09 20:27:43,773 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 52 [2018-04-09 20:27:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:27:43,774 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-04-09 20:27:43,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-09 20:27:43,774 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-04-09 20:27:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-09 20:27:43,774 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:27:43,774 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-09 20:27:43,774 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:27:43,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1423352212, 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-09 20:27:43,780 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:27:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:27:43,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:27:43,805 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-09 20:27:43,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:27:43,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:43,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:43,814 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-09 20:27:43,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-09 20:27:43,940 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-09 20:27:43,947 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-09 20:27:43,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:27:43,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:27:43,962 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-09 20:27:43,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-09 20:27:44,033 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-09 20:27:44,033 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:27:44,322 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-09 20:27:44,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:44,351 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-09 20:27:44,361 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-09 20:27:44,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:44,362 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:44,367 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-09 20:27:44,367 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-04-09 20:27:44,378 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-09 20:27:44,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:27:44,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-09 20:27:44,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 20:27:44,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 20:27:44,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-04-09 20:27:44,400 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 21 states. [2018-04-09 20:27:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:27:44,948 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-04-09 20:27:44,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-09 20:27:44,949 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-04-09 20:27:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:27:44,949 INFO L225 Difference]: With dead ends: 114 [2018-04-09 20:27:44,949 INFO L226 Difference]: Without dead ends: 113 [2018-04-09 20:27:44,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2018-04-09 20:27:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-09 20:27:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2018-04-09 20:27:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-09 20:27:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-04-09 20:27:44,958 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 55 [2018-04-09 20:27:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:27:44,958 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-04-09 20:27:44,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 20:27:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-04-09 20:27:44,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-09 20:27:44,959 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:27:44,959 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:27:44,959 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:27:44,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1450268478, 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-09 20:27:44,965 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:27:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:27:44,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:27:44,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:27:44,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:27:45,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,013 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-09 20:27:45,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-09 20:27:45,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:45,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:45,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 20:27:45,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:45,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:45,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:27:45,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-04-09 20:27:45,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-09 20:27:45,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 20:27:45,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-09 20:27:45,248 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-09 20:27:45,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 20:27:45,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:27:45,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:27:45,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-09 20:27:45,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:55 [2018-04-09 20:27:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:27:45,393 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:27:45,802 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-09 20:27:45,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 20:27:45,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-04-09 20:27:45,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-04-09 20:27:45,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,947 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-09 20:27:45,955 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 20:27:45,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:27:45,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:45,962 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-09 20:27:45,962 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 20:27:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:27:46,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:27:46,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2018-04-09 20:27:46,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-09 20:27:46,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-09 20:27:46,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1595, Unknown=0, NotChecked=0, Total=1722 [2018-04-09 20:27:46,048 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 42 states. [2018-04-09 20:27:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:27:48,560 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-04-09 20:27:48,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-09 20:27:48,560 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 59 [2018-04-09 20:27:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:27:48,561 INFO L225 Difference]: With dead ends: 150 [2018-04-09 20:27:48,561 INFO L226 Difference]: Without dead ends: 146 [2018-04-09 20:27:48,562 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=610, Invalid=4940, Unknown=0, NotChecked=0, Total=5550 [2018-04-09 20:27:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-09 20:27:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 112. [2018-04-09 20:27:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-09 20:27:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-04-09 20:27:48,572 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 59 [2018-04-09 20:27:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:27:48,572 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-04-09 20:27:48,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-09 20:27:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-04-09 20:27:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 20:27:48,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:27:48,573 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:27:48,573 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:27:48,574 INFO L82 PathProgramCache]: Analyzing trace with hash 222042014, now seen corresponding path program 2 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-09 20:27:48,579 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:27:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:27:48,612 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:27:48,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:27:48,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:48,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:27:48,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:48,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:48,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-09 20:27:48,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:48,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:48,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-09 20:27:48,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:48,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:48,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:48,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:27:48,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:48,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:48,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-09 20:27:48,711 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 19 treesize of output 16 [2018-04-09 20:27:48,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-09 20:27:48,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:48,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:48,721 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-09 20:27:48,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-09 20:27:48,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:48,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-09 20:27:48,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 20:27:48,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:48,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:48,756 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-09 20:27:48,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-04-09 20:27:49,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:27:49,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-04-09 20:27:49,221 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-09 20:27:49,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:27:49,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 22 treesize of output 19 [2018-04-09 20:27:49,231 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:49,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:27:49,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-09 20:27:49,254 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:73, output treesize:128 [2018-04-09 20:27:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:27:49,516 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:27:50,461 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 76 treesize of output 49 [2018-04-09 20:27:50,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-09 20:27:50,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:50,498 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 37 treesize of output 39 [2018-04-09 20:27:50,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2018-04-09 20:27:50,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-09 20:27:50,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-04-09 20:27:50,550 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:50,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 26 treesize of output 21 [2018-04-09 20:27:50,563 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:50,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:27:50,589 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-09 20:27:50,610 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-09 20:27:50,610 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:89, output treesize:100 [2018-04-09 20:27:50,918 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-04-09 20:27:50,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:27:50,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:50,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:50,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-04-09 20:27:50,954 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:50,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-09 20:27:50,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:50,977 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-04-09 20:27:50,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:27:50,992 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:27:50,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:27:51,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:27:51,006 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:72, output treesize:25 [2018-04-09 20:27:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:27:51,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:27:51,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 51 [2018-04-09 20:27:51,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-09 20:27:51,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-09 20:27:51,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2463, Unknown=0, NotChecked=0, Total=2652 [2018-04-09 20:27:51,178 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 52 states. [2018-04-09 20:27:57,899 WARN L151 SmtUtils]: Spent 6586ms on a formula simplification. DAG size of input: 100 DAG size of output 98 [2018-04-09 20:28:02,418 WARN L151 SmtUtils]: Spent 4422ms on a formula simplification. DAG size of input: 95 DAG size of output 93 [2018-04-09 20:28:07,580 WARN L151 SmtUtils]: Spent 5014ms on a formula simplification. DAG size of input: 93 DAG size of output 74 [2018-04-09 20:28:09,277 WARN L148 SmtUtils]: Spent 234ms on a formula simplification that was a NOOP. DAG size: 90 [2018-04-09 20:28:15,577 WARN L151 SmtUtils]: Spent 1883ms on a formula simplification. DAG size of input: 85 DAG size of output 66 [2018-04-09 20:28:19,949 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 88 DAG size of output 84 [2018-04-09 20:28:20,401 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 97 DAG size of output 93 [2018-04-09 20:28:21,496 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 101 DAG size of output 94 [2018-04-09 20:28:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:28:23,390 INFO L93 Difference]: Finished difference Result 210 states and 221 transitions. [2018-04-09 20:28:23,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-09 20:28:23,390 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 66 [2018-04-09 20:28:23,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:28:23,392 INFO L225 Difference]: With dead ends: 210 [2018-04-09 20:28:23,392 INFO L226 Difference]: Without dead ends: 204 [2018-04-09 20:28:23,394 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2833 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=1039, Invalid=10733, Unknown=0, NotChecked=0, Total=11772 [2018-04-09 20:28:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-09 20:28:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 126. [2018-04-09 20:28:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-09 20:28:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-04-09 20:28:23,407 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 66 [2018-04-09 20:28:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:28:23,408 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-04-09 20:28:23,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-09 20:28:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-04-09 20:28:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-09 20:28:23,408 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:28:23,408 INFO L355 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2018-04-09 20:28:23,408 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:28:23,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1352767189, 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-09 20:28:23,416 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:28:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:28:23,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:28:23,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-09 20:28:23,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:23,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:28:23,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:23,462 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-09 20:28:23,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 20:28:23,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:23,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:23,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 20:28:23,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:23,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:23,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:23,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:28:23,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:23,494 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-09 20:28:23,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-09 20:28:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:28:23,774 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:28:24,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-04-09 20:28:24,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:24,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09 20:28:24,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:28:24,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:24,376 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 20:28:24,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:24,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:24,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:24,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 20:28:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:28:24,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:28:24,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-04-09 20:28:24,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-09 20:28:24,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-09 20:28:24,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2018-04-09 20:28:24,443 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 43 states. [2018-04-09 20:28:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:28:26,673 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2018-04-09 20:28:26,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-09 20:28:26,673 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 67 [2018-04-09 20:28:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:28:26,674 INFO L225 Difference]: With dead ends: 190 [2018-04-09 20:28:26,674 INFO L226 Difference]: Without dead ends: 184 [2018-04-09 20:28:26,676 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=678, Invalid=5022, Unknown=0, NotChecked=0, Total=5700 [2018-04-09 20:28:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-09 20:28:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 176. [2018-04-09 20:28:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-09 20:28:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-04-09 20:28:26,690 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 67 [2018-04-09 20:28:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:28:26,691 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-04-09 20:28:26,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-09 20:28:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-04-09 20:28:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-09 20:28:26,692 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:28:26,692 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-09 20:28:26,692 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:28:26,692 INFO L82 PathProgramCache]: Analyzing trace with hash -521560857, now seen corresponding path program 2 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-09 20:28:26,706 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:28:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:28:26,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:28:26,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:28:26,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:26,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:26,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:28:26,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:28:26,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:26,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:26,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:26,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:28:26,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:26,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:26,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 20:28:26,784 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-09 20:28:26,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:28:26,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:26,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:26,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:26,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-09 20:28:26,896 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-09 20:28:26,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:28:26,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:26,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:26,908 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-09 20:28:26,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-09 20:28:26,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 21 treesize of output 17 [2018-04-09 20:28:26,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 20:28:26,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:28:26,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:28:26,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:28:26,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-09 20:28:27,051 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-09 20:28:27,051 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:28:27,804 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-09 20:28:27,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:28:27,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:27,828 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-09 20:28:27,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-09 20:28:27,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:27,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:27,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-09 20:28:27,836 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-09 20:28:27,836 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:27,839 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:27,848 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-09 20:28:27,867 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-09 20:28:27,867 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-09 20:28:28,015 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-09 20:28:28,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:28:28,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-04-09 20:28:28,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-09 20:28:28,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-09 20:28:28,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-04-09 20:28:28,036 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 40 states. [2018-04-09 20:28:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:28:29,542 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-04-09 20:28:29,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-09 20:28:29,543 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 70 [2018-04-09 20:28:29,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:28:29,543 INFO L225 Difference]: With dead ends: 177 [2018-04-09 20:28:29,544 INFO L226 Difference]: Without dead ends: 176 [2018-04-09 20:28:29,544 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=386, Invalid=3274, Unknown=0, NotChecked=0, Total=3660 [2018-04-09 20:28:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-09 20:28:29,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-04-09 20:28:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-09 20:28:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 185 transitions. [2018-04-09 20:28:29,566 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 185 transitions. Word has length 70 [2018-04-09 20:28:29,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:28:29,566 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 185 transitions. [2018-04-09 20:28:29,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-09 20:28:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 185 transitions. [2018-04-09 20:28:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-09 20:28:29,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:28:29,567 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:28:29,567 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:28:29,567 INFO L82 PathProgramCache]: Analyzing trace with hash -384644725, 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-09 20:28:29,574 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:28:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:28:29,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:28:29,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:28:29,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:29,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:28:29,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:29,673 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-09 20:28:29,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 20:28:29,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:29,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:29,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 20:28:29,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:29,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:29,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:29,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:28:29,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:29,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:29,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-04-09 20:28:29,745 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-09 20:28:29,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:28:29,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:29,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:29,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:29,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-09 20:28:30,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:30,047 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-09 20:28:30,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 20:28:30,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:30,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:30,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:30,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-04-09 20:28:30,178 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-09 20:28:30,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 20:28:30,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:28:30,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:28:30,215 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 2 xjuncts. [2018-04-09 20:28:30,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:51 [2018-04-09 20:28:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:28:30,389 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:28:32,031 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 41 treesize of output 32 [2018-04-09 20:28:32,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:28:32,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:32,060 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-09 20:28:32,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-04-09 20:28:32,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:32,065 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:32,067 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-09 20:28:32,069 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-09 20:28:32,069 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:32,072 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:32,098 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-09 20:28:32,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-04-09 20:28:32,122 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:65, output treesize:209 [2018-04-09 20:28:32,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-04-09 20:28:32,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:32,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09 20:28:32,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:28:32,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:32,478 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 20:28:32,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:32,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:32,483 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-09 20:28:32,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 20:28:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:28:32,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:28:32,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2018-04-09 20:28:32,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-09 20:28:32,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-09 20:28:32,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2505, Unknown=0, NotChecked=0, Total=2652 [2018-04-09 20:28:32,572 INFO L87 Difference]: Start difference. First operand 176 states and 185 transitions. Second operand 52 states. [2018-04-09 20:28:34,191 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 97 DAG size of output 76 [2018-04-09 20:28:34,608 WARN L151 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 103 DAG size of output 76 [2018-04-09 20:28:34,916 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 107 DAG size of output 80 [2018-04-09 20:28:35,602 WARN L151 SmtUtils]: Spent 313ms on a formula simplification. DAG size of input: 125 DAG size of output 98 [2018-04-09 20:28:36,115 WARN L151 SmtUtils]: Spent 275ms on a formula simplification. DAG size of input: 109 DAG size of output 89 [2018-04-09 20:28:36,773 WARN L151 SmtUtils]: Spent 295ms on a formula simplification. DAG size of input: 118 DAG size of output 101 [2018-04-09 20:28:37,294 WARN L148 SmtUtils]: Spent 129ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-09 20:28:42,085 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 89 DAG size of output 86 [2018-04-09 20:28:42,684 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 88 DAG size of output 82 [2018-04-09 20:28:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:28:43,793 INFO L93 Difference]: Finished difference Result 240 states and 252 transitions. [2018-04-09 20:28:43,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-09 20:28:43,794 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 74 [2018-04-09 20:28:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:28:43,795 INFO L225 Difference]: With dead ends: 240 [2018-04-09 20:28:43,795 INFO L226 Difference]: Without dead ends: 234 [2018-04-09 20:28:43,797 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1201, Invalid=10789, Unknown=0, NotChecked=0, Total=11990 [2018-04-09 20:28:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-04-09 20:28:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 211. [2018-04-09 20:28:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-09 20:28:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 221 transitions. [2018-04-09 20:28:43,811 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 221 transitions. Word has length 74 [2018-04-09 20:28:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:28:43,811 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 221 transitions. [2018-04-09 20:28:43,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-09 20:28:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 221 transitions. [2018-04-09 20:28:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-09 20:28:43,811 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:28:43,812 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1] [2018-04-09 20:28:43,812 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:28:43,812 INFO L82 PathProgramCache]: Analyzing trace with hash 109371527, 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-09 20:28:43,821 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:28:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:28:43,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:28:43,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:28:43,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:43,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:43,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:28:43,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:28:43,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:43,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:43,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:43,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:28:43,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:43,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:43,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 20:28:43,894 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-09 20:28:43,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:28:43,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:43,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:43,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:43,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-09 20:28:44,048 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-09 20:28:44,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 20:28:44,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:44,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:44,060 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-09 20:28:44,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-09 20:28:44,123 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-09 20:28:44,129 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-09 20:28:44,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:28:44,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:28:44,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:28:44,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-09 20:28:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-09 20:28:44,222 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:28:45,097 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-09 20:28:45,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:28:45,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:45,124 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-09 20:28:45,126 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-09 20:28:45,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:45,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:45,136 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-09 20:28:45,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-09 20:28:45,139 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:45,140 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:45,151 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-09 20:28:45,170 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-09 20:28:45,170 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:84 [2018-04-09 20:28:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-09 20:28:45,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:28:45,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-04-09 20:28:45,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-09 20:28:45,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-09 20:28:45,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-04-09 20:28:45,360 INFO L87 Difference]: Start difference. First operand 211 states and 221 transitions. Second operand 42 states. [2018-04-09 20:28:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:28:47,083 INFO L93 Difference]: Finished difference Result 240 states and 249 transitions. [2018-04-09 20:28:47,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-09 20:28:47,083 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 77 [2018-04-09 20:28:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:28:47,084 INFO L225 Difference]: With dead ends: 240 [2018-04-09 20:28:47,084 INFO L226 Difference]: Without dead ends: 239 [2018-04-09 20:28:47,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=538, Invalid=4432, Unknown=0, NotChecked=0, Total=4970 [2018-04-09 20:28:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-09 20:28:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 192. [2018-04-09 20:28:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-09 20:28:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 203 transitions. [2018-04-09 20:28:47,101 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 203 transitions. Word has length 77 [2018-04-09 20:28:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:28:47,102 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 203 transitions. [2018-04-09 20:28:47,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-09 20:28:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 203 transitions. [2018-04-09 20:28:47,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-09 20:28:47,102 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:28:47,102 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:28:47,102 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:28:47,103 INFO L82 PathProgramCache]: Analyzing trace with hash 613204894, now seen corresponding path program 3 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-09 20:28:47,108 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:28:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:28:47,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:28:47,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:28:47,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:47,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:28:47,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:47,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:47,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-09 20:28:47,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:47,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:47,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:28:47,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:47,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:47,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-09 20:28:47,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:47,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:47,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2018-04-09 20:28:47,231 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 19 treesize of output 16 [2018-04-09 20:28:47,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-09 20:28:47,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:47,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:47,244 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-09 20:28:47,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-09 20:28:47,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:47,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-09 20:28:47,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 20:28:47,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:47,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:47,277 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-09 20:28:47,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-04-09 20:28:48,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:48,382 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 65 treesize of output 57 [2018-04-09 20:28:48,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, 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-09 20:28:48,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:28:48,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:48,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:48,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:28:48,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2018-04-09 20:28:48,406 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:48,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:28:48,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-09 20:28:48,449 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:102, output treesize:244 [2018-04-09 20:28:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:28:48,805 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:28:51,968 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 172 treesize of output 89 [2018-04-09 20:28:52,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-09 20:28:52,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:52,047 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 55 treesize of output 53 [2018-04-09 20:28:52,088 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 49 treesize of output 47 [2018-04-09 20:28:52,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:52,109 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:28:52,109 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:28:52,109 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:28:52,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 74 [2018-04-09 20:28:52,112 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:52,137 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:28:52,137 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:28:52,138 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:28:52,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 113 [2018-04-09 20:28:52,154 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-04-09 20:28:52,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:28:52,218 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-09 20:28:52,268 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-09 20:28:52,268 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:191, output treesize:571 [2018-04-09 20:28:52,628 WARN L151 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 94 DAG size of output 65 [2018-04-09 20:28:53,034 WARN L151 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 89 DAG size of output 74 [2018-04-09 20:28:53,688 WARN L151 SmtUtils]: Spent 420ms on a formula simplification. DAG size of input: 168 DAG size of output 157 [2018-04-09 20:28:54,108 WARN L148 SmtUtils]: Spent 174ms on a formula simplification that was a NOOP. DAG size: 177 [2018-04-09 20:28:54,253 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 229 DAG size of output 117 [2018-04-09 20:28:54,256 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-04-09 20:28:54,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:28:54,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-09 20:28:54,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-04-09 20:28:54,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-09 20:28:54,393 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,398 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-09 20:28:54,445 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,491 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-09 20:28:54,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-09 20:28:54,508 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,513 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-04-09 20:28:54,562 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,605 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-04-09 20:28:54,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:28:54,623 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,628 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-04-09 20:28:54,672 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-09 20:28:54,713 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-09 20:28:54,754 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-04-09 20:28:54,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:28:54,808 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,812 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-09 20:28:54,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:28:54,868 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,872 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-09 20:28:54,911 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-04-09 20:28:54,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:28:54,963 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-09 20:28:54,967 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:28:55,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 14 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-09 20:28:55,001 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 48 variables, input treesize:527, output treesize:81 [2018-04-09 20:28:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:28:55,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:28:55,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2018-04-09 20:28:55,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-09 20:28:55,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-09 20:28:55,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=4382, Unknown=0, NotChecked=0, Total=4692 [2018-04-09 20:28:55,289 INFO L87 Difference]: Start difference. First operand 192 states and 203 transitions. Second operand 69 states. [2018-04-09 20:28:56,316 WARN L151 SmtUtils]: Spent 722ms on a formula simplification. DAG size of input: 271 DAG size of output 209 [2018-04-09 20:28:57,281 WARN L151 SmtUtils]: Spent 682ms on a formula simplification. DAG size of input: 268 DAG size of output 205 [2018-04-09 20:28:57,867 WARN L151 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 263 DAG size of output 98 [2018-04-09 20:29:06,527 WARN L151 SmtUtils]: Spent 321ms on a formula simplification. DAG size of input: 84 DAG size of output 81 [2018-04-09 20:29:06,793 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 111 [2018-04-09 20:29:07,339 WARN L148 SmtUtils]: Spent 146ms on a formula simplification that was a NOOP. DAG size: 124 [2018-04-09 20:29:08,130 WARN L148 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 126 [2018-04-09 20:29:08,429 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 118 DAG size of output 115 [2018-04-09 20:29:09,258 WARN L151 SmtUtils]: Spent 361ms on a formula simplification. DAG size of input: 91 DAG size of output 88 [2018-04-09 20:29:10,500 WARN L148 SmtUtils]: Spent 189ms on a formula simplification that was a NOOP. DAG size: 76 [2018-04-09 20:29:11,240 WARN L148 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 69 [2018-04-09 20:29:11,737 WARN L151 SmtUtils]: Spent 297ms on a formula simplification. DAG size of input: 116 DAG size of output 115 [2018-04-09 20:29:12,387 WARN L151 SmtUtils]: Spent 267ms on a formula simplification. DAG size of input: 118 DAG size of output 117 [2018-04-09 20:29:12,970 WARN L151 SmtUtils]: Spent 316ms on a formula simplification. DAG size of input: 116 DAG size of output 115 [2018-04-09 20:29:13,345 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 113 DAG size of output 112 [2018-04-09 20:29:13,868 WARN L151 SmtUtils]: Spent 325ms on a formula simplification. DAG size of input: 135 DAG size of output 134 [2018-04-09 20:29:16,666 WARN L148 SmtUtils]: Spent 245ms on a formula simplification that was a NOOP. DAG size: 125 [2018-04-09 20:29:17,122 WARN L151 SmtUtils]: Spent 252ms on a formula simplification. DAG size of input: 124 DAG size of output 121 [2018-04-09 20:29:17,536 WARN L148 SmtUtils]: Spent 136ms on a formula simplification that was a NOOP. DAG size: 105 [2018-04-09 20:29:18,390 WARN L151 SmtUtils]: Spent 359ms on a formula simplification. DAG size of input: 111 DAG size of output 110 [2018-04-09 20:29:19,091 WARN L151 SmtUtils]: Spent 448ms on a formula simplification. DAG size of input: 113 DAG size of output 112 [2018-04-09 20:29:19,843 WARN L151 SmtUtils]: Spent 433ms on a formula simplification. DAG size of input: 111 DAG size of output 110 [2018-04-09 20:29:20,344 WARN L151 SmtUtils]: Spent 273ms on a formula simplification. DAG size of input: 108 DAG size of output 107 [2018-04-09 20:29:21,423 WARN L151 SmtUtils]: Spent 654ms on a formula simplification. DAG size of input: 134 DAG size of output 133 [2018-04-09 20:29:22,287 WARN L148 SmtUtils]: Spent 173ms on a formula simplification that was a NOOP. DAG size: 135 [2018-04-09 20:29:23,043 WARN L151 SmtUtils]: Spent 495ms on a formula simplification. DAG size of input: 119 DAG size of output 116 [2018-04-09 20:29:23,432 WARN L148 SmtUtils]: Spent 133ms on a formula simplification that was a NOOP. DAG size: 111 [2018-04-09 20:29:24,197 WARN L151 SmtUtils]: Spent 305ms on a formula simplification. DAG size of input: 80 DAG size of output 78 [2018-04-09 20:29:24,701 WARN L148 SmtUtils]: Spent 181ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-09 20:29:25,871 WARN L151 SmtUtils]: Spent 821ms on a formula simplification. DAG size of input: 149 DAG size of output 135 [2018-04-09 20:29:26,932 WARN L151 SmtUtils]: Spent 790ms on a formula simplification. DAG size of input: 147 DAG size of output 133 [2018-04-09 20:29:27,716 WARN L151 SmtUtils]: Spent 451ms on a formula simplification. DAG size of input: 114 DAG size of output 113 [2018-04-09 20:29:28,921 WARN L151 SmtUtils]: Spent 947ms on a formula simplification. DAG size of input: 172 DAG size of output 161 [2018-04-09 20:29:29,636 WARN L151 SmtUtils]: Spent 393ms on a formula simplification. DAG size of input: 129 DAG size of output 121 [2018-04-09 20:29:30,259 WARN L151 SmtUtils]: Spent 327ms on a formula simplification. DAG size of input: 129 DAG size of output 128 [2018-04-09 20:29:30,874 WARN L151 SmtUtils]: Spent 318ms on a formula simplification. DAG size of input: 103 DAG size of output 92 [2018-04-09 20:29:31,604 WARN L151 SmtUtils]: Spent 440ms on a formula simplification. DAG size of input: 114 DAG size of output 113 [2018-04-09 20:29:32,496 WARN L151 SmtUtils]: Spent 633ms on a formula simplification. DAG size of input: 140 DAG size of output 127 [2018-04-09 20:29:33,283 WARN L151 SmtUtils]: Spent 408ms on a formula simplification. DAG size of input: 111 DAG size of output 96 [2018-04-09 20:29:34,264 WARN L151 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 103 DAG size of output 87 [2018-04-09 20:29:35,188 WARN L151 SmtUtils]: Spent 524ms on a formula simplification. DAG size of input: 119 DAG size of output 102 [2018-04-09 20:29:36,049 WARN L151 SmtUtils]: Spent 374ms on a formula simplification. DAG size of input: 105 DAG size of output 92 [2018-04-09 20:29:36,518 WARN L151 SmtUtils]: Spent 256ms on a formula simplification. DAG size of input: 121 DAG size of output 110 [2018-04-09 20:29:37,009 WARN L151 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 114 DAG size of output 110 [2018-04-09 20:29:37,882 WARN L151 SmtUtils]: Spent 452ms on a formula simplification. DAG size of input: 113 DAG size of output 99 [2018-04-09 20:29:38,534 WARN L151 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 95 DAG size of output 86 [2018-04-09 20:29:39,455 WARN L151 SmtUtils]: Spent 376ms on a formula simplification. DAG size of input: 101 DAG size of output 89 [2018-04-09 20:29:40,208 WARN L151 SmtUtils]: Spent 313ms on a formula simplification. DAG size of input: 94 DAG size of output 80 [2018-04-09 20:29:41,046 WARN L151 SmtUtils]: Spent 409ms on a formula simplification. DAG size of input: 117 DAG size of output 101 [2018-04-09 20:29:41,776 WARN L151 SmtUtils]: Spent 276ms on a formula simplification. DAG size of input: 97 DAG size of output 86 [2018-04-09 20:29:42,697 WARN L151 SmtUtils]: Spent 405ms on a formula simplification. DAG size of input: 103 DAG size of output 96 [2018-04-09 20:29:43,201 WARN L148 SmtUtils]: Spent 204ms on a formula simplification that was a NOOP. DAG size: 96 [2018-04-09 20:29:43,895 WARN L151 SmtUtils]: Spent 327ms on a formula simplification. DAG size of input: 105 DAG size of output 93 [2018-04-09 20:29:44,384 WARN L148 SmtUtils]: Spent 159ms on a formula simplification that was a NOOP. DAG size: 80 [2018-04-09 20:29:45,182 WARN L151 SmtUtils]: Spent 306ms on a formula simplification. DAG size of input: 82 DAG size of output 80 [2018-04-09 20:29:46,010 WARN L151 SmtUtils]: Spent 385ms on a formula simplification. DAG size of input: 113 DAG size of output 98 [2018-04-09 20:29:47,168 WARN L151 SmtUtils]: Spent 427ms on a formula simplification. DAG size of input: 90 DAG size of output 87 [2018-04-09 20:29:48,009 WARN L151 SmtUtils]: Spent 423ms on a formula simplification. DAG size of input: 109 DAG size of output 96 [2018-04-09 20:29:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:29:48,019 INFO L93 Difference]: Finished difference Result 315 states and 333 transitions. [2018-04-09 20:29:48,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-09 20:29:48,019 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 80 [2018-04-09 20:29:48,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:29:48,020 INFO L225 Difference]: With dead ends: 315 [2018-04-09 20:29:48,020 INFO L226 Difference]: Without dead ends: 309 [2018-04-09 20:29:48,022 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 85 SyntacticMatches, 7 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6323 ImplicationChecksByTransitivity, 46.3s TimeCoverageRelationStatistics Valid=2132, Invalid=21430, Unknown=0, NotChecked=0, Total=23562 [2018-04-09 20:29:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-09 20:29:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 220. [2018-04-09 20:29:48,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-09 20:29:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 235 transitions. [2018-04-09 20:29:48,043 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 235 transitions. Word has length 80 [2018-04-09 20:29:48,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:29:48,043 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 235 transitions. [2018-04-09 20:29:48,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-09 20:29:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2018-04-09 20:29:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-09 20:29:48,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:29:48,044 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2018-04-09 20:29:48,044 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:29:48,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2111619797, now seen corresponding path program 2 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-09 20:29:48,049 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:29:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:29:48,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:29:48,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:29:48,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:29:48,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:29:48,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:29:48,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:29:48,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:24 [2018-04-09 20:29:48,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:29:48,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:29:48,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:29:48,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:29:48,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 20:29:48,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:29:48,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:29:48,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-04-09 20:29:48,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-09 20:29:48,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-09 20:29:48,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:29:48,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:29:48,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:29:48,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-04-09 20:29:48,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-09 20:29:48,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 20:29:48,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:29:48,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:29:48,370 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-09 20:29:48,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:49 [2018-04-09 20:29:48,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-04-09 20:29:48,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 19 treesize of output 16 [2018-04-09 20:29:48,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:29:48,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-09 20:29:48,738 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:29:48,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:29:48,752 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-09 20:29:48,753 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:75 [2018-04-09 20:29:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:29:49,766 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:29:52,136 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 18 treesize of output 16 [2018-04-09 20:29:52,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-09 20:29:52,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:29:52,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:29:52,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:29:52,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:58 [2018-04-09 20:29:52,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-04-09 20:29:52,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:29:52,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:29:52,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:29:52,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-09 20:29:52,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:29:52,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-04-09 20:29:52,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:29:52,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-04-09 20:29:52,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:29:52,793 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:29:52,800 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:29:52,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:29:52,818 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:88, output treesize:39 [2018-04-09 20:29:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:29:53,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:29:53,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 68 [2018-04-09 20:29:53,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-09 20:29:53,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-09 20:29:53,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=4456, Unknown=0, NotChecked=0, Total=4692 [2018-04-09 20:29:53,177 INFO L87 Difference]: Start difference. First operand 220 states and 235 transitions. Second operand 69 states. [2018-04-09 20:29:53,491 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 75 DAG size of output 73 [2018-04-09 20:29:53,935 WARN L151 SmtUtils]: Spent 267ms on a formula simplification. DAG size of input: 104 DAG size of output 102 [2018-04-09 20:29:54,579 WARN L151 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 102 DAG size of output 87 [2018-04-09 20:29:57,462 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 120 DAG size of output 116 [2018-04-09 20:29:58,066 WARN L151 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 114 DAG size of output 109 [2018-04-09 20:29:58,418 WARN L151 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 116 DAG size of output 107 [2018-04-09 20:29:58,743 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 110 DAG size of output 106 [2018-04-09 20:29:59,544 WARN L151 SmtUtils]: Spent 269ms on a formula simplification. DAG size of input: 88 DAG size of output 78 [2018-04-09 20:29:59,877 WARN L151 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 123 DAG size of output 103 [2018-04-09 20:30:00,143 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 96 DAG size of output 95 [2018-04-09 20:30:00,576 WARN L151 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 149 DAG size of output 131 [2018-04-09 20:30:00,969 WARN L151 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 83 DAG size of output 74 [2018-04-09 20:30:01,502 WARN L151 SmtUtils]: Spent 273ms on a formula simplification. DAG size of input: 135 DAG size of output 126 [2018-04-09 20:30:01,828 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 112 DAG size of output 108 [2018-04-09 20:30:02,243 WARN L151 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 92 DAG size of output 83 [2018-04-09 20:30:02,596 WARN L151 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 108 DAG size of output 103 [2018-04-09 20:30:06,285 WARN L151 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 101 DAG size of output 96 [2018-04-09 20:30:06,873 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 103 DAG size of output 94 [2018-04-09 20:30:07,456 WARN L151 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 114 DAG size of output 113 [2018-04-09 20:30:07,980 WARN L151 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 106 DAG size of output 101 [2018-04-09 20:30:08,593 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 111 DAG size of output 105 [2018-04-09 20:30:09,143 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 115 DAG size of output 111 [2018-04-09 20:30:09,940 WARN L151 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 120 DAG size of output 112 [2018-04-09 20:30:10,644 WARN L151 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 105 DAG size of output 102 [2018-04-09 20:30:11,437 WARN L151 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 116 DAG size of output 111 [2018-04-09 20:30:11,725 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 92 DAG size of output 89 [2018-04-09 20:30:12,338 WARN L151 SmtUtils]: Spent 314ms on a formula simplification. DAG size of input: 98 DAG size of output 93 [2018-04-09 20:30:12,803 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 102 DAG size of output 96 [2018-04-09 20:30:13,420 WARN L151 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 86 DAG size of output 83 [2018-04-09 20:30:13,702 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 97 DAG size of output 93 [2018-04-09 20:30:14,339 WARN L151 SmtUtils]: Spent 421ms on a formula simplification. DAG size of input: 106 DAG size of output 100 [2018-04-09 20:30:17,152 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 109 DAG size of output 104 [2018-04-09 20:30:17,800 WARN L151 SmtUtils]: Spent 415ms on a formula simplification. DAG size of input: 104 DAG size of output 99 [2018-04-09 20:30:18,316 WARN L151 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 111 DAG size of output 102 [2018-04-09 20:30:18,719 WARN L151 SmtUtils]: Spent 260ms on a formula simplification. DAG size of input: 84 DAG size of output 82 [2018-04-09 20:30:19,326 WARN L148 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 88 [2018-04-09 20:30:19,581 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 97 DAG size of output 92 [2018-04-09 20:30:19,982 WARN L151 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 79 DAG size of output 77 [2018-04-09 20:30:20,685 WARN L151 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 82 DAG size of output 80 [2018-04-09 20:30:21,134 WARN L151 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 91 DAG size of output 85 [2018-04-09 20:30:22,115 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 66 DAG size of output 54 [2018-04-09 20:30:22,405 WARN L151 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 66 DAG size of output 58 [2018-04-09 20:30:22,672 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 64 DAG size of output 56 [2018-04-09 20:30:22,880 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 48 DAG size of output 45 [2018-04-09 20:30:23,172 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 49 DAG size of output 44 [2018-04-09 20:30:23,397 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 47 DAG size of output 42 [2018-04-09 20:30:23,592 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 46 DAG size of output 39 [2018-04-09 20:30:23,860 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 65 DAG size of output 61 [2018-04-09 20:30:24,280 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 55 DAG size of output 49 [2018-04-09 20:30:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:30:24,837 INFO L93 Difference]: Finished difference Result 347 states and 366 transitions. [2018-04-09 20:30:24,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-04-09 20:30:24,837 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 81 [2018-04-09 20:30:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:30:24,839 INFO L225 Difference]: With dead ends: 347 [2018-04-09 20:30:24,839 INFO L226 Difference]: Without dead ends: 340 [2018-04-09 20:30:24,841 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6551 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=2109, Invalid=24951, Unknown=0, NotChecked=0, Total=27060 [2018-04-09 20:30:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-04-09 20:30:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 310. [2018-04-09 20:30:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-04-09 20:30:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 328 transitions. [2018-04-09 20:30:24,868 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 328 transitions. Word has length 81 [2018-04-09 20:30:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:30:24,869 INFO L459 AbstractCegarLoop]: Abstraction has 310 states and 328 transitions. [2018-04-09 20:30:24,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-09 20:30:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 328 transitions. [2018-04-09 20:30:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-09 20:30:24,870 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:30:24,870 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2018-04-09 20:30:24,870 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:30:24,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1199254547, 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-09 20:30:24,878 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:30:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:30:24,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:30:24,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:30:24,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:24,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:30:24,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:24,931 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-09 20:30:24,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-09 20:30:24,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:30:24,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:30:24,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 20:30:24,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:24,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:30:24,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:30:24,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:30:24,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:24,977 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-09 20:30:24,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-04-09 20:30:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:30:25,673 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:30:27,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-04-09 20:30:27,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:27,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-04-09 20:30:27,344 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 20:30:27,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:27,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-04-09 20:30:27,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:27,351 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:27,357 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-09 20:30:27,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:17 [2018-04-09 20:30:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:30:27,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:30:27,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-04-09 20:30:27,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-09 20:30:27,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-09 20:30:27,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3545, Unknown=0, NotChecked=0, Total=3782 [2018-04-09 20:30:27,529 INFO L87 Difference]: Start difference. First operand 310 states and 328 transitions. Second operand 62 states. [2018-04-09 20:30:29,806 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 74 DAG size of output 72 [2018-04-09 20:30:30,670 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 79 DAG size of output 71 [2018-04-09 20:30:30,935 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 72 DAG size of output 70 [2018-04-09 20:30:31,129 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 74 DAG size of output 68 [2018-04-09 20:30:32,299 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 77 DAG size of output 69 [2018-04-09 20:30:35,433 WARN L148 SmtUtils]: Spent 298ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-09 20:30:35,834 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 87 DAG size of output 78 [2018-04-09 20:30:36,105 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 90 DAG size of output 80 [2018-04-09 20:30:36,369 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 86 DAG size of output 76 [2018-04-09 20:30:36,650 WARN L151 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 101 DAG size of output 88 [2018-04-09 20:30:37,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:30:37,342 INFO L93 Difference]: Finished difference Result 336 states and 354 transitions. [2018-04-09 20:30:37,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-09 20:30:37,342 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 85 [2018-04-09 20:30:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:30:37,343 INFO L225 Difference]: With dead ends: 336 [2018-04-09 20:30:37,343 INFO L226 Difference]: Without dead ends: 335 [2018-04-09 20:30:37,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3952 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2088, Invalid=16002, Unknown=0, NotChecked=0, Total=18090 [2018-04-09 20:30:37,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-09 20:30:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 300. [2018-04-09 20:30:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-04-09 20:30:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 316 transitions. [2018-04-09 20:30:37,379 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 316 transitions. Word has length 85 [2018-04-09 20:30:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:30:37,379 INFO L459 AbstractCegarLoop]: Abstraction has 300 states and 316 transitions. [2018-04-09 20:30:37,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-09 20:30:37,380 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 316 transitions. [2018-04-09 20:30:37,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-09 20:30:37,381 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:30:37,381 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-09 20:30:37,381 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:30:37,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1788071628, now seen corresponding path program 3 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-09 20:30:37,394 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:30:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:30:37,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:30:37,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:30:37,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:37,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:37,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:30:37,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:30:37,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:30:37,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:30:37,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:37,451 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-09 20:30:37,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:37,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:37,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 20:30:37,468 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-09 20:30:37,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:30:37,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:37,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:37,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:37,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-09 20:30:37,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-09 20:30:37,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 20:30:37,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:37,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:37,595 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-09 20:30:37,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-09 20:30:37,659 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-09 20:30:37,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 20:30:37,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:37,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:37,676 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-09 20:30:37,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-09 20:30:37,735 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-09 20:30:37,740 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-09 20:30:37,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:30:37,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:30:37,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:30:37,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-09 20:30:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:30:37,832 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:30:39,010 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-09 20:30:39,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:30:39,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:39,034 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-09 20:30:39,036 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-09 20:30:39,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:39,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:39,039 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-09 20:30:39,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-09 20:30:39,041 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:39,042 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:39,052 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-09 20:30:39,068 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-09 20:30:39,069 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-09 20:30:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:30:39,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:30:39,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-04-09 20:30:39,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-09 20:30:39,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-09 20:30:39,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1928, Unknown=0, NotChecked=0, Total=2070 [2018-04-09 20:30:39,295 INFO L87 Difference]: Start difference. First operand 300 states and 316 transitions. Second operand 46 states. [2018-04-09 20:30:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:30:41,667 INFO L93 Difference]: Finished difference Result 371 states and 388 transitions. [2018-04-09 20:30:41,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-09 20:30:41,668 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 85 [2018-04-09 20:30:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:30:41,669 INFO L225 Difference]: With dead ends: 371 [2018-04-09 20:30:41,669 INFO L226 Difference]: Without dead ends: 370 [2018-04-09 20:30:41,670 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=781, Invalid=5539, Unknown=0, NotChecked=0, Total=6320 [2018-04-09 20:30:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-04-09 20:30:41,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 366. [2018-04-09 20:30:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-04-09 20:30:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 384 transitions. [2018-04-09 20:30:41,698 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 384 transitions. Word has length 85 [2018-04-09 20:30:41,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:30:41,698 INFO L459 AbstractCegarLoop]: Abstraction has 366 states and 384 transitions. [2018-04-09 20:30:41,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-09 20:30:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 384 transitions. [2018-04-09 20:30:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-09 20:30:41,699 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:30:41,699 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-09 20:30:41,699 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:30:41,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1908792397, 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-09 20:30:41,705 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:30:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:30:41,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:30:41,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:30:41,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:41,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:30:41,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:41,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:41,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-09 20:30:41,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:30:41,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:30:41,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:30:41,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:41,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:30:41,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-09 20:30:41,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:41,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:41,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-09 20:30:41,833 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 19 treesize of output 16 [2018-04-09 20:30:41,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-09 20:30:41,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:41,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:41,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:41,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-04-09 20:30:41,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:30:41,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-09 20:30:41,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 20:30:41,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:41,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:41,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-09 20:30:41,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-09 20:30:42,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:30:42,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-04-09 20:30:42,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2018-04-09 20:30:42,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:30:42,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-09 20:30:42,249 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:42,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:30:42,262 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-09 20:30:42,262 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:58, output treesize:63 [2018-04-09 20:30:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:30:43,457 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:30:46,165 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 18 treesize of output 16 [2018-04-09 20:30:46,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-09 20:30:46,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:46,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:46,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:46,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:58 [2018-04-09 20:30:46,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-04-09 20:30:46,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:46,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-04-09 20:30:46,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:30:46,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:46,796 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:46,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-04-09 20:30:46,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:46,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-04-09 20:30:46,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 20:30:46,856 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:30:46,863 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:30:46,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:30:46,880 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:88, output treesize:39 [2018-04-09 20:30:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:30:47,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:30:47,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 72 [2018-04-09 20:30:47,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-09 20:30:47,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-09 20:30:47,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=5007, Unknown=0, NotChecked=0, Total=5256 [2018-04-09 20:30:47,136 INFO L87 Difference]: Start difference. First operand 366 states and 384 transitions. Second operand 73 states. [2018-04-09 20:30:47,599 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 74 DAG size of output 72 [2018-04-09 20:30:47,996 WARN L151 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 103 DAG size of output 101 [2018-04-09 20:30:48,537 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 101 DAG size of output 86 [2018-04-09 20:30:52,577 WARN L148 SmtUtils]: Spent 2057ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-09 20:30:54,495 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 123 DAG size of output 117 [2018-04-09 20:30:54,800 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 107 DAG size of output 103 [2018-04-09 20:30:57,379 WARN L151 SmtUtils]: Spent 2167ms on a formula simplification. DAG size of input: 103 DAG size of output 98 [2018-04-09 20:30:57,703 WARN L151 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 105 DAG size of output 96 [2018-04-09 20:30:57,956 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 85 DAG size of output 84 [2018-04-09 20:31:01,099 WARN L151 SmtUtils]: Spent 252ms on a formula simplification. DAG size of input: 88 DAG size of output 79 [2018-04-09 20:31:01,398 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 97 DAG size of output 96 [2018-04-09 20:31:01,732 WARN L151 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 83 DAG size of output 75 [2018-04-09 20:31:03,169 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 108 DAG size of output 103 [2018-04-09 20:31:03,540 WARN L151 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 92 DAG size of output 84 [2018-04-09 20:31:04,047 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 95 DAG size of output 90 [2018-04-09 20:31:04,554 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 97 DAG size of output 88 [2018-04-09 20:31:05,030 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 92 DAG size of output 88 [2018-04-09 20:31:05,673 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 106 DAG size of output 85 [2018-04-09 20:31:06,715 WARN L151 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 130 DAG size of output 113 [2018-04-09 20:31:07,481 WARN L151 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 114 DAG size of output 106 [2018-04-09 20:31:07,749 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 94 DAG size of output 90 [2018-04-09 20:31:08,126 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 89 DAG size of output 85 [2018-04-09 20:31:10,959 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 95 DAG size of output 90 Received shutdown request... [2018-04-09 20:31:11,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-09 20:31:11,493 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 20:31:11,496 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 20:31:11,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 08:31:11 BoogieIcfgContainer [2018-04-09 20:31:11,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 20:31:11,497 INFO L168 Benchmark]: Toolchain (without parser) took 263436.17 ms. Allocated memory was 302.0 MB in the beginning and 392.7 MB in the end (delta: 90.7 MB). Free memory was 239.5 MB in the beginning and 280.2 MB in the end (delta: -40.7 MB). Peak memory consumption was 50.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:31:11,498 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 302.0 MB. Free memory is still 264.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 20:31:11,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.03 ms. Allocated memory is still 302.0 MB. Free memory was 239.5 MB in the beginning and 215.4 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:31:11,499 INFO L168 Benchmark]: Boogie Preprocessor took 57.67 ms. Allocated memory is still 302.0 MB. Free memory was 215.4 MB in the beginning and 212.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:31:11,499 INFO L168 Benchmark]: RCFGBuilder took 522.22 ms. Allocated memory was 302.0 MB in the beginning and 462.4 MB in the end (delta: 160.4 MB). Free memory was 212.5 MB in the beginning and 395.2 MB in the end (delta: -182.7 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-04-09 20:31:11,499 INFO L168 Benchmark]: TraceAbstraction took 262534.49 ms. Allocated memory was 462.4 MB in the beginning and 392.7 MB in the end (delta: -69.7 MB). Free memory was 393.7 MB in the beginning and 280.2 MB in the end (delta: 113.5 MB). Peak memory consumption was 43.8 MB. Max. memory is 5.3 GB. [2018-04-09 20:31:11,500 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.24 ms. Allocated memory is still 302.0 MB. Free memory is still 264.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 317.03 ms. Allocated memory is still 302.0 MB. Free memory was 239.5 MB in the beginning and 215.4 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 57.67 ms. Allocated memory is still 302.0 MB. Free memory was 215.4 MB in the beginning and 212.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 522.22 ms. Allocated memory was 302.0 MB in the beginning and 462.4 MB in the end (delta: 160.4 MB). Free memory was 212.5 MB in the beginning and 395.2 MB in the end (delta: -182.7 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 262534.49 ms. Allocated memory was 462.4 MB in the beginning and 392.7 MB in the end (delta: -69.7 MB). Free memory was 393.7 MB in the beginning and 280.2 MB in the end (delta: 113.5 MB). Peak memory consumption was 43.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 57 states, 73 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 57 states, 73 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 57 states, 73 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 57 states, 73 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 57 states, 73 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 57 states, 73 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 57 states, 73 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 57 states, 73 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 57 states, 73 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 57 states, 73 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 57 states, 73 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 57 states, 73 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 57 states, 73 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 97. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 99 locations, 13 error locations. TIMEOUT Result, 262.4s OverallTime, 31 OverallIterations, 5 TraceHistogramMax, 220.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2234 SDtfs, 8209 SDslu, 26278 SDs, 0 SdLazy, 21621 SolverSat, 1337 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 55.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3852 GetRequests, 2370 SyntacticMatches, 36 SemanticMatches, 1445 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 30417 ImplicationChecksByTransitivity, 195.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366occurred in iteration=30, 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.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 665 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 39.5s InterpolantComputationTime, 1597 NumberOfCodeBlocks, 1597 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 3132 ConstructedInterpolants, 645 QuantifiedInterpolants, 3989670 SizeOfPredicates, 629 NumberOfNonLiveVariables, 4771 ConjunctsInSsa, 1147 ConjunctsInUnsatCore, 62 InterpolantComputations, 34 PerfectInterpolantSequences, 18/692 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_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_20-31-11-507.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_20-31-11-507.csv Completed graceful shutdown