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