java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 20:48:52,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 20:48:52,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 20:48:52,957 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 20:48:52,957 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 20:48:52,958 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 20:48:52,959 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 20:48:52,960 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 20:48:52,962 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 20:48:52,963 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 20:48:52,963 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 20:48:52,963 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 20:48:52,964 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 20:48:52,965 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 20:48:52,966 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 20:48:52,967 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 20:48:52,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 20:48:52,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 20:48:52,971 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 20:48:52,972 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 20:48:52,973 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 20:48:52,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 20:48:52,974 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 20:48:52,975 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 20:48:52,975 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 20:48:52,976 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 20:48:52,976 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 20:48:52,977 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 20:48:52,977 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 20:48:52,978 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 20:48:52,978 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 20:48:52,978 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 20:48:53,000 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 20:48:53,000 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 20:48:53,001 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 20:48:53,001 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 20:48:53,002 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 20:48:53,002 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 20:48:53,002 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 20:48:53,002 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 20:48:53,002 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 20:48:53,002 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 20:48:53,002 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 20:48:53,003 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 20:48:53,003 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 20:48:53,003 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 20:48:53,003 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 20:48:53,003 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 20:48:53,003 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 20:48:53,003 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 20:48:53,004 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 20:48:53,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 20:48:53,004 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 20:48:53,004 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 20:48:53,004 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 20:48:53,004 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 20:48:53,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 20:48:53,044 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 20:48:53,047 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 20:48:53,048 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 20:48:53,049 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 20:48:53,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,344 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcf9059fb4 [2018-04-11 20:48:53,464 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 20:48:53,464 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 20:48:53,464 INFO L168 CDTParser]: Scanning substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,471 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 20:48:53,472 INFO L215 ultiparseSymbolTable]: [2018-04-11 20:48:53,472 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 20:48:53,472 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ ('') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,472 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,472 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,472 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,472 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 20:48:53,472 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__register_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____socklen_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,473 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,474 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,474 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____intptr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,474 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,474 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,474 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__size_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,474 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,474 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,474 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsword_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,474 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,474 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,475 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,475 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uint in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,475 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,475 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,475 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,475 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,475 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,475 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__div_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,475 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,475 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,476 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,476 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,476 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,476 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,476 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,476 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__wchar_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,476 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,476 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__lldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,476 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,476 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,476 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ulong in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____useconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_set in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ushort in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____qaddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:53,495 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcf9059fb4 [2018-04-11 20:48:53,499 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 20:48:53,500 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 20:48:53,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 20:48:53,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 20:48:53,505 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 20:48:53,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 08:48:53" (1/1) ... [2018-04-11 20:48:53,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a165300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:48:53, skipping insertion in model container [2018-04-11 20:48:53,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 08:48:53" (1/1) ... [2018-04-11 20:48:53,518 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 20:48:53,539 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 20:48:53,649 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 20:48:53,681 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 20:48:53,686 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 20:48:53,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:48:53 WrapperNode [2018-04-11 20:48:53,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 20:48:53,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 20:48:53,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 20:48:53,724 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 20:48:53,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:48:53" (1/1) ... [2018-04-11 20:48:53,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:48:53" (1/1) ... [2018-04-11 20:48:53,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:48:53" (1/1) ... [2018-04-11 20:48:53,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:48:53" (1/1) ... [2018-04-11 20:48:53,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:48:53" (1/1) ... [2018-04-11 20:48:53,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:48:53" (1/1) ... [2018-04-11 20:48:53,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:48:53" (1/1) ... [2018-04-11 20:48:53,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 20:48:53,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 20:48:53,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 20:48:53,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 20:48:53,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:48:53" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 20:48:53,869 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 20:48:53,870 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 20:48:53,870 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 20:48:53,870 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 20:48:53,870 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-04-11 20:48:53,870 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 20:48:53,870 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 20:48:53,870 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 20:48:53,870 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 20:48:53,870 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 20:48:53,870 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 20:48:53,870 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 20:48:53,870 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 20:48:53,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 20:48:53,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 20:48:53,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 20:48:53,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 20:48:53,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 20:48:53,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 20:48:53,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 20:48:53,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 20:48:53,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 20:48:53,872 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 20:48:53,872 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 20:48:53,872 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 20:48:53,872 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 20:48:53,872 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 20:48:53,872 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 20:48:53,872 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 20:48:53,872 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 20:48:53,872 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 20:48:53,873 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 20:48:53,873 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 20:48:53,873 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 20:48:53,873 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 20:48:53,873 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 20:48:53,873 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 20:48:53,873 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 20:48:53,873 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 20:48:53,873 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 20:48:53,873 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 20:48:53,874 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 20:48:53,874 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 20:48:53,874 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 20:48:53,874 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 20:48:53,874 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 20:48:53,874 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 20:48:53,874 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 20:48:53,874 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 20:48:53,874 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 20:48:53,875 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 20:48:53,875 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 20:48:53,875 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 20:48:53,875 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 20:48:53,875 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 20:48:53,875 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 20:48:53,875 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 20:48:53,875 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 20:48:53,875 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 20:48:53,876 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 20:48:53,876 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 20:48:53,876 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 20:48:53,876 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 20:48:53,876 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 20:48:53,876 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 20:48:53,876 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 20:48:53,876 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 20:48:53,876 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 20:48:53,876 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 20:48:53,876 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 20:48:53,877 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 20:48:53,877 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 20:48:53,877 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 20:48:53,877 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 20:48:53,877 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 20:48:53,877 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 20:48:53,877 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 20:48:53,877 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 20:48:53,877 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 20:48:53,877 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 20:48:53,878 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 20:48:53,878 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 20:48:53,878 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 20:48:53,878 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 20:48:53,878 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 20:48:53,878 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 20:48:53,878 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 20:48:53,878 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 20:48:53,878 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 20:48:53,878 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 20:48:53,878 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 20:48:53,879 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 20:48:53,879 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 20:48:53,879 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 20:48:53,879 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 20:48:53,879 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 20:48:53,879 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 20:48:53,879 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 20:48:53,879 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 20:48:53,879 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 20:48:53,879 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 20:48:53,879 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 20:48:53,880 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 20:48:53,880 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 20:48:53,880 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 20:48:53,880 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 20:48:53,880 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 20:48:53,880 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 20:48:53,880 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 20:48:53,880 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-04-11 20:48:53,880 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 20:48:53,880 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 20:48:53,880 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 20:48:53,881 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 20:48:53,881 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 20:48:53,881 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 20:48:53,881 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 20:48:53,881 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 20:48:54,169 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 20:48:54,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 08:48:54 BoogieIcfgContainer [2018-04-11 20:48:54,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 20:48:54,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 20:48:54,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 20:48:54,173 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 20:48:54,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 08:48:53" (1/3) ... [2018-04-11 20:48:54,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0d65dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 08:48:54, skipping insertion in model container [2018-04-11 20:48:54,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:48:53" (2/3) ... [2018-04-11 20:48:54,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0d65dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 08:48:54, skipping insertion in model container [2018-04-11 20:48:54,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 08:48:54" (3/3) ... [2018-04-11 20:48:54,176 INFO L107 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:48:54,182 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 20:48:54,188 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-11 20:48:54,211 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 20:48:54,211 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 20:48:54,211 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 20:48:54,211 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 20:48:54,211 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 20:48:54,211 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 20:48:54,211 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 20:48:54,212 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 20:48:54,212 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 20:48:54,212 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 20:48:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-04-11 20:48:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 20:48:54,227 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:54,228 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:54,228 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:54,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1359245197, now seen corresponding path program 1 times [2018-04-11 20:48:54,232 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:54,232 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:54,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:54,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:54,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:54,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:54,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:54,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 20:48:54,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 20:48:54,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 20:48:54,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 20:48:54,380 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-04-11 20:48:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:54,452 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-04-11 20:48:54,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 20:48:54,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 20:48:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:54,462 INFO L225 Difference]: With dead ends: 55 [2018-04-11 20:48:54,462 INFO L226 Difference]: Without dead ends: 52 [2018-04-11 20:48:54,464 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 20:48:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-11 20:48:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-11 20:48:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 20:48:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-11 20:48:54,495 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-04-11 20:48:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:54,495 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-11 20:48:54,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 20:48:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-11 20:48:54,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 20:48:54,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:54,496 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:54,496 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:54,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1359245198, now seen corresponding path program 1 times [2018-04-11 20:48:54,496 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:54,496 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:54,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:54,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:54,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:54,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:54,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:54,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 20:48:54,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 20:48:54,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 20:48:54,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 20:48:54,585 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-04-11 20:48:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:54,662 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-04-11 20:48:54,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:48:54,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 20:48:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:54,663 INFO L225 Difference]: With dead ends: 51 [2018-04-11 20:48:54,664 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 20:48:54,664 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-11 20:48:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 20:48:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-11 20:48:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 20:48:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-11 20:48:54,668 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-04-11 20:48:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:54,669 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-11 20:48:54,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 20:48:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-11 20:48:54,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 20:48:54,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:54,669 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:54,669 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:54,669 INFO L82 PathProgramCache]: Analyzing trace with hash -813071859, now seen corresponding path program 1 times [2018-04-11 20:48:54,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:54,669 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:54,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:54,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:54,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:54,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:54,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:54,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 20:48:54,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 20:48:54,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 20:48:54,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 20:48:54,700 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-04-11 20:48:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:54,743 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-04-11 20:48:54,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 20:48:54,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 20:48:54,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:54,744 INFO L225 Difference]: With dead ends: 50 [2018-04-11 20:48:54,744 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 20:48:54,745 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 20:48:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 20:48:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-11 20:48:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 20:48:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-11 20:48:54,748 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-04-11 20:48:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:54,749 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-11 20:48:54,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 20:48:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-11 20:48:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 20:48:54,749 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:54,749 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:54,749 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:54,750 INFO L82 PathProgramCache]: Analyzing trace with hash -813071858, now seen corresponding path program 1 times [2018-04-11 20:48:54,750 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:54,750 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:54,750 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:54,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:54,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:54,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:54,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:54,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 20:48:54,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 20:48:54,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 20:48:54,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 20:48:54,811 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-04-11 20:48:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:54,833 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-11 20:48:54,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:48:54,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 20:48:54,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:54,834 INFO L225 Difference]: With dead ends: 49 [2018-04-11 20:48:54,834 INFO L226 Difference]: Without dead ends: 49 [2018-04-11 20:48:54,835 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 20:48:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-11 20:48:54,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-11 20:48:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-11 20:48:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-11 20:48:54,838 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-04-11 20:48:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:54,838 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-11 20:48:54,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 20:48:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-11 20:48:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 20:48:54,839 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:54,839 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:54,839 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash 198035442, now seen corresponding path program 1 times [2018-04-11 20:48:54,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:54,840 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:54,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:54,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:54,841 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:54,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:54,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:54,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 20:48:54,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 20:48:54,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 20:48:54,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 20:48:54,877 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-04-11 20:48:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:54,915 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-11 20:48:54,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 20:48:54,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 20:48:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:54,915 INFO L225 Difference]: With dead ends: 48 [2018-04-11 20:48:54,915 INFO L226 Difference]: Without dead ends: 48 [2018-04-11 20:48:54,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 20:48:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-11 20:48:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-11 20:48:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-11 20:48:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-04-11 20:48:54,917 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-04-11 20:48:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:54,918 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-04-11 20:48:54,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 20:48:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-04-11 20:48:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 20:48:54,918 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:54,918 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:54,918 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:54,918 INFO L82 PathProgramCache]: Analyzing trace with hash 198035443, now seen corresponding path program 1 times [2018-04-11 20:48:54,918 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:54,918 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:54,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:54,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:54,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:54,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:54,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:54,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 20:48:54,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 20:48:54,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 20:48:54,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 20:48:54,982 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-04-11 20:48:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:55,083 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-04-11 20:48:55,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 20:48:55,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-11 20:48:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:55,085 INFO L225 Difference]: With dead ends: 72 [2018-04-11 20:48:55,086 INFO L226 Difference]: Without dead ends: 72 [2018-04-11 20:48:55,086 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-11 20:48:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-11 20:48:55,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-04-11 20:48:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 20:48:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-11 20:48:55,088 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-04-11 20:48:55,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:55,089 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-11 20:48:55,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 20:48:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-11 20:48:55,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 20:48:55,089 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:55,089 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:55,089 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:55,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1611194078, now seen corresponding path program 1 times [2018-04-11 20:48:55,089 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:55,089 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:55,090 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:55,090 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:55,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:55,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:55,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 20:48:55,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 20:48:55,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 20:48:55,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 20:48:55,132 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-04-11 20:48:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:55,176 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-04-11 20:48:55,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:48:55,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-11 20:48:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:55,177 INFO L225 Difference]: With dead ends: 51 [2018-04-11 20:48:55,177 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 20:48:55,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 20:48:55,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 20:48:55,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-04-11 20:48:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 20:48:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-11 20:48:55,180 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-04-11 20:48:55,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:55,180 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-11 20:48:55,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 20:48:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-11 20:48:55,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 20:48:55,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:55,180 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:55,180 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:55,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1611194077, now seen corresponding path program 1 times [2018-04-11 20:48:55,181 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:55,181 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:55,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:55,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:55,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:55,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:55,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 20:48:55,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 20:48:55,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 20:48:55,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 20:48:55,258 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-04-11 20:48:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:55,350 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-04-11 20:48:55,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 20:48:55,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-11 20:48:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:55,351 INFO L225 Difference]: With dead ends: 66 [2018-04-11 20:48:55,351 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 20:48:55,351 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-11 20:48:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 20:48:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-04-11 20:48:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 20:48:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-04-11 20:48:55,353 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-04-11 20:48:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:55,354 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-04-11 20:48:55,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 20:48:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-04-11 20:48:55,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 20:48:55,354 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:55,354 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:55,354 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:55,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1620411736, now seen corresponding path program 1 times [2018-04-11 20:48:55,354 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:55,354 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:55,355 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:55,355 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:55,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:55,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:55,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 20:48:55,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 20:48:55,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 20:48:55,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 20:48:55,398 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-04-11 20:48:55,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:55,464 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-04-11 20:48:55,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:48:55,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-11 20:48:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:55,465 INFO L225 Difference]: With dead ends: 59 [2018-04-11 20:48:55,465 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 20:48:55,465 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 20:48:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 20:48:55,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-04-11 20:48:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 20:48:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-04-11 20:48:55,468 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-04-11 20:48:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:55,468 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-04-11 20:48:55,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 20:48:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-04-11 20:48:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 20:48:55,469 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:55,469 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:55,469 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:55,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1620411735, now seen corresponding path program 1 times [2018-04-11 20:48:55,470 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:55,470 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:55,470 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:55,470 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:55,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:55,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:55,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 20:48:55,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 20:48:55,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 20:48:55,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 20:48:55,540 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-04-11 20:48:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:55,647 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2018-04-11 20:48:55,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 20:48:55,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-11 20:48:55,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:55,648 INFO L225 Difference]: With dead ends: 92 [2018-04-11 20:48:55,648 INFO L226 Difference]: Without dead ends: 92 [2018-04-11 20:48:55,648 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-04-11 20:48:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-11 20:48:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-04-11 20:48:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-11 20:48:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-04-11 20:48:55,653 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-04-11 20:48:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:55,653 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-04-11 20:48:55,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 20:48:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-04-11 20:48:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 20:48:55,654 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:55,654 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:55,655 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:55,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1307124962, now seen corresponding path program 1 times [2018-04-11 20:48:55,655 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:55,655 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:55,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:55,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:55,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:55,674 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:55,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 20:48:55,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 20:48:55,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 20:48:55,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 20:48:55,675 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-04-11 20:48:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:55,680 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-04-11 20:48:55,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 20:48:55,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-04-11 20:48:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:55,681 INFO L225 Difference]: With dead ends: 64 [2018-04-11 20:48:55,681 INFO L226 Difference]: Without dead ends: 64 [2018-04-11 20:48:55,682 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 20:48:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-11 20:48:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-04-11 20:48:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-11 20:48:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-04-11 20:48:55,685 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-04-11 20:48:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:55,685 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-04-11 20:48:55,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 20:48:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-04-11 20:48:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 20:48:55,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:55,686 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:55,686 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:55,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2015624486, now seen corresponding path program 1 times [2018-04-11 20:48:55,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:55,686 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:55,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:55,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:55,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:55,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:55,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 20:48:55,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 20:48:55,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 20:48:55,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 20:48:55,722 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-04-11 20:48:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:55,777 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-04-11 20:48:55,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 20:48:55,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-11 20:48:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:55,778 INFO L225 Difference]: With dead ends: 70 [2018-04-11 20:48:55,778 INFO L226 Difference]: Without dead ends: 70 [2018-04-11 20:48:55,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-11 20:48:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-11 20:48:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-04-11 20:48:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 20:48:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-04-11 20:48:55,781 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-04-11 20:48:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:55,782 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-04-11 20:48:55,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 20:48:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-04-11 20:48:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 20:48:55,782 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:55,782 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] [2018-04-11 20:48:55,782 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:55,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1801524697, now seen corresponding path program 1 times [2018-04-11 20:48:55,782 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:55,782 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:55,783 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:55,783 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:55,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:55,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:55,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 20:48:55,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 20:48:55,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 20:48:55,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 20:48:55,859 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2018-04-11 20:48:55,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:55,938 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-04-11 20:48:55,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 20:48:55,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-04-11 20:48:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:55,938 INFO L225 Difference]: With dead ends: 66 [2018-04-11 20:48:55,938 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 20:48:55,939 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-11 20:48:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 20:48:55,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 20:48:55,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 20:48:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-04-11 20:48:55,940 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-04-11 20:48:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:55,940 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-04-11 20:48:55,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 20:48:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-04-11 20:48:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 20:48:55,941 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:55,941 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:55,941 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:55,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1695652845, now seen corresponding path program 1 times [2018-04-11 20:48:55,941 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:55,941 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:55,942 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:55,942 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:55,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:56,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:56,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 20:48:56,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 20:48:56,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 20:48:56,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-04-11 20:48:56,139 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 17 states. [2018-04-11 20:48:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:56,397 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-04-11 20:48:56,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 20:48:56,397 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-04-11 20:48:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:56,397 INFO L225 Difference]: With dead ends: 109 [2018-04-11 20:48:56,397 INFO L226 Difference]: Without dead ends: 109 [2018-04-11 20:48:56,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992 [2018-04-11 20:48:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-11 20:48:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 74. [2018-04-11 20:48:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 20:48:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-04-11 20:48:56,400 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 29 [2018-04-11 20:48:56,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:56,400 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-04-11 20:48:56,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 20:48:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-04-11 20:48:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 20:48:56,400 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:56,400 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:56,400 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash 793876117, now seen corresponding path program 1 times [2018-04-11 20:48:56,400 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:56,401 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:56,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:56,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:56,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:56,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:56,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:56,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 20:48:56,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 20:48:56,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 20:48:56,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-11 20:48:56,499 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 11 states. [2018-04-11 20:48:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:56,594 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-04-11 20:48:56,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 20:48:56,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-04-11 20:48:56,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:56,594 INFO L225 Difference]: With dead ends: 104 [2018-04-11 20:48:56,594 INFO L226 Difference]: Without dead ends: 74 [2018-04-11 20:48:56,595 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-04-11 20:48:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-11 20:48:56,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-04-11 20:48:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 20:48:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-04-11 20:48:56,597 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 29 [2018-04-11 20:48:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:56,597 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-04-11 20:48:56,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 20:48:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-04-11 20:48:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 20:48:56,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:56,598 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:56,598 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1012730835, now seen corresponding path program 1 times [2018-04-11 20:48:56,598 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:56,598 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:56,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:56,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:56,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:56,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:56,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 20:48:56,740 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 20:48:56,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:56,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:48:56,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 20:48:56,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 20:48:56,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:48:56,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:48:56,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 20:48:56,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-11 20:48:57,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-11 20:48:57,009 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 14 treesize of output 11 [2018-04-11 20:48:57,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:48:57,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:48:57,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:48:57,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-04-11 20:48:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:57,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:48:57,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-04-11 20:48:57,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 20:48:57,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 20:48:57,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-04-11 20:48:57,123 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 20 states. [2018-04-11 20:48:58,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:58,260 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-04-11 20:48:58,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 20:48:58,260 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-04-11 20:48:58,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:58,261 INFO L225 Difference]: With dead ends: 97 [2018-04-11 20:48:58,261 INFO L226 Difference]: Without dead ends: 95 [2018-04-11 20:48:58,261 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-04-11 20:48:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-11 20:48:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2018-04-11 20:48:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 20:48:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-04-11 20:48:58,263 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 29 [2018-04-11 20:48:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:58,264 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-04-11 20:48:58,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 20:48:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-04-11 20:48:58,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 20:48:58,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:58,264 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:58,264 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:58,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1864805931, now seen corresponding path program 1 times [2018-04-11 20:48:58,265 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:58,265 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:58,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:58,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:58,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:58,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:58,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:48:58,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 20:48:58,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 20:48:58,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 20:48:58,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-04-11 20:48:58,379 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 11 states. [2018-04-11 20:48:58,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:58,448 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-04-11 20:48:58,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:48:58,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-04-11 20:48:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:58,449 INFO L225 Difference]: With dead ends: 74 [2018-04-11 20:48:58,449 INFO L226 Difference]: Without dead ends: 62 [2018-04-11 20:48:58,449 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-04-11 20:48:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-11 20:48:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-04-11 20:48:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-11 20:48:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-04-11 20:48:58,451 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 31 [2018-04-11 20:48:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:58,451 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-04-11 20:48:58,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 20:48:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-04-11 20:48:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 20:48:58,452 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:58,452 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:48:58,452 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:58,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1724257321, now seen corresponding path program 1 times [2018-04-11 20:48:58,453 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:58,453 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:58,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:58,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:58,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:58,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:58,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 20:48:58,630 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 20:48:58,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:58,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:48:58,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:48:58,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:48:58,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:48:58,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 20:48:58,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:48:58,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:48:58,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:48:58,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:48:58,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:48:58,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 20:48:58,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 20:48:58,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 20:48:58,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:48:58,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:48:58,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 20:48:58,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-11 20:48:58,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 20:48:58,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 20:48:58,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:48:58,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:48:58,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 20:48:58,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-11 20:48:58,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-11 20:48:58,839 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 14 treesize of output 11 [2018-04-11 20:48:58,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:48:58,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-11 20:48:58,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:48:58,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:48:58,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:48:58,858 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-04-11 20:48:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:58,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:48:58,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-04-11 20:48:58,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 20:48:58,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 20:48:58,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-04-11 20:48:58,942 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 23 states. [2018-04-11 20:48:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:48:59,478 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2018-04-11 20:48:59,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 20:48:59,478 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-04-11 20:48:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:48:59,478 INFO L225 Difference]: With dead ends: 125 [2018-04-11 20:48:59,479 INFO L226 Difference]: Without dead ends: 125 [2018-04-11 20:48:59,479 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 20:48:59,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-11 20:48:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2018-04-11 20:48:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 20:48:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-04-11 20:48:59,480 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 31 [2018-04-11 20:48:59,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:48:59,481 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-04-11 20:48:59,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 20:48:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2018-04-11 20:48:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 20:48:59,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:48:59,481 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 20:48:59,481 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:48:59,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1820036441, now seen corresponding path program 1 times [2018-04-11 20:48:59,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:48:59,481 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:48:59,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:59,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:59,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:48:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:59,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:48:59,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:48:59,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 20:48:59,741 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 20:48:59,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:48:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:48:59,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:48:59,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:48:59,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:48:59,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:48:59,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 20:48:59,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:48:59,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:48:59,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:48:59,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:48:59,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:48:59,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 20:48:59,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 20:48:59,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 20:48:59,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:48:59,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:48:59,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 20:48:59,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-11 20:48:59,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 20:48:59,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 20:48:59,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:48:59,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:48:59,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 20:48:59,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-11 20:49:00,731 WARN L148 SmtUtils]: Spent 669ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-11 20:49:00,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-04-11 20:49:00,842 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-04-11 20:49:00,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 20:49:00,901 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 41 treesize of output 33 [2018-04-11 20:49:00,901 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:00,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-04-11 20:49:00,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-11 20:49:01,027 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 33 treesize of output 31 [2018-04-11 20:49:01,028 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 20:49:01,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-04-11 20:49:01,096 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:01,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-11 20:49:01,098 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:01,159 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 31 treesize of output 23 [2018-04-11 20:49:01,160 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:01,161 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 35 treesize of output 27 [2018-04-11 20:49:01,161 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:01,163 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 34 treesize of output 26 [2018-04-11 20:49:01,163 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:01,219 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 37 treesize of output 29 [2018-04-11 20:49:01,219 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:01,281 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 29 treesize of output 27 [2018-04-11 20:49:01,281 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-11 20:49:01,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-11 20:49:01,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 20:49:01,360 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-04-11 20:49:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:49:01,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:49:01,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2018-04-11 20:49:01,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 20:49:01,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 20:49:01,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 20:49:01,446 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 33 states. [2018-04-11 20:49:02,267 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 94 DAG size of output 68 [2018-04-11 20:49:02,693 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 115 DAG size of output 75 [2018-04-11 20:49:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:49:04,190 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-04-11 20:49:04,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 20:49:04,191 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-04-11 20:49:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:49:04,191 INFO L225 Difference]: With dead ends: 100 [2018-04-11 20:49:04,191 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 20:49:04,192 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=335, Invalid=2215, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 20:49:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 20:49:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2018-04-11 20:49:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 20:49:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2018-04-11 20:49:04,194 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 33 [2018-04-11 20:49:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:49:04,194 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2018-04-11 20:49:04,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 20:49:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2018-04-11 20:49:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 20:49:04,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:49:04,195 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-11 20:49:04,195 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:49:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2127994563, now seen corresponding path program 2 times [2018-04-11 20:49:04,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:49:04,195 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:49:04,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:49:04,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:49:04,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:49:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:49:04,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:49:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:49:04,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 20:49:04,425 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 20:49:04,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 20:49:04,456 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 20:49:04,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 20:49:04,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:49:04,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:49:04,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:04,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:04,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 20:49:04,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 20:49:04,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 20:49:04,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:04,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:04,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:04,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 20:49:04,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-11 20:49:04,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 20:49:04,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:49:04,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:49:04,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:49:04,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-04-11 20:49:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:49:04,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:49:04,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-04-11 20:49:04,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 20:49:04,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 20:49:04,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-04-11 20:49:04,772 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 22 states. [2018-04-11 20:49:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:49:05,460 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-04-11 20:49:05,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 20:49:05,460 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-04-11 20:49:05,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:49:05,461 INFO L225 Difference]: With dead ends: 102 [2018-04-11 20:49:05,461 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 20:49:05,461 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=980, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 20:49:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 20:49:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 60. [2018-04-11 20:49:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 20:49:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-04-11 20:49:05,462 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 37 [2018-04-11 20:49:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:49:05,462 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-04-11 20:49:05,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 20:49:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-04-11 20:49:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 20:49:05,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:49:05,463 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 20:49:05,463 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:49:05,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1372787131, now seen corresponding path program 1 times [2018-04-11 20:49:05,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:49:05,463 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:49:05,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:49:05,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 20:49:05,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:49:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:49:05,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:49:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:49:05,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 20:49:05,511 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 20:49:05,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:49:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:49:05,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:49:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:49:05,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:49:05,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2018-04-11 20:49:05,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 20:49:05,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 20:49:05,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 20:49:05,565 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 10 states. [2018-04-11 20:49:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:49:05,635 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-04-11 20:49:05,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 20:49:05,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-11 20:49:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:49:05,636 INFO L225 Difference]: With dead ends: 75 [2018-04-11 20:49:05,636 INFO L226 Difference]: Without dead ends: 75 [2018-04-11 20:49:05,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-04-11 20:49:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-11 20:49:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-04-11 20:49:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-11 20:49:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-04-11 20:49:05,637 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 38 [2018-04-11 20:49:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:49:05,637 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-04-11 20:49:05,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 20:49:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-04-11 20:49:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 20:49:05,638 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:49:05,638 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:49:05,638 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:49:05,638 INFO L82 PathProgramCache]: Analyzing trace with hash -518903735, now seen corresponding path program 2 times [2018-04-11 20:49:05,638 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:49:05,638 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:49:05,639 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:49:05,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:49:05,639 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:49:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:49:05,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:49:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:49:05,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 20:49:05,960 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 20:49:05,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 20:49:05,986 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 20:49:05,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 20:49:05,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:49:06,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:49:06,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:06,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:06,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 20:49:06,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:49:06,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:49:06,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:49:06,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:06,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:06,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 20:49:06,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 20:49:06,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 11 treesize of output 10 [2018-04-11 20:49:06,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:06,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:06,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 20:49:06,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 20:49:06,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 20:49:06,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 20:49:06,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:06,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:06,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 20:49:06,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2018-04-11 20:49:06,916 WARN L148 SmtUtils]: Spent 470ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-11 20:49:07,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 61 [2018-04-11 20:49:07,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:49:07,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 58 [2018-04-11 20:49:07,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:49:07,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:49:07,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 72 [2018-04-11 20:49:07,092 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-11 20:49:07,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:49:07,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 58 [2018-04-11 20:49:07,174 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 20:49:07,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-11 20:49:07,243 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:07,244 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 36 treesize of output 28 [2018-04-11 20:49:07,245 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:07,310 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 40 treesize of output 32 [2018-04-11 20:49:07,311 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:07,312 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 44 treesize of output 36 [2018-04-11 20:49:07,312 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:07,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-04-11 20:49:07,374 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:07,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-11 20:49:07,375 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:07,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-11 20:49:07,431 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:07,432 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 43 treesize of output 35 [2018-04-11 20:49:07,432 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:07,434 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 44 treesize of output 36 [2018-04-11 20:49:07,434 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:07,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-11 20:49:07,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 20:49:07,557 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:72, output treesize:81 [2018-04-11 20:49:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:49:07,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:49:07,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2018-04-11 20:49:07,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 20:49:07,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 20:49:07,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 20:49:07,689 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 36 states. [2018-04-11 20:49:08,357 WARN L151 SmtUtils]: Spent 307ms on a formula simplification. DAG size of input: 60 DAG size of output 54 [2018-04-11 20:49:10,580 WARN L151 SmtUtils]: Spent 2091ms on a formula simplification. DAG size of input: 85 DAG size of output 69 [2018-04-11 20:49:16,974 WARN L151 SmtUtils]: Spent 4053ms on a formula simplification. DAG size of input: 86 DAG size of output 71 [2018-04-11 20:49:19,436 WARN L151 SmtUtils]: Spent 2416ms on a formula simplification. DAG size of input: 96 DAG size of output 78 [2018-04-11 20:49:21,586 WARN L151 SmtUtils]: Spent 2096ms on a formula simplification. DAG size of input: 96 DAG size of output 75 [2018-04-11 20:49:28,220 WARN L151 SmtUtils]: Spent 6566ms on a formula simplification. DAG size of input: 103 DAG size of output 79 [2018-04-11 20:49:33,185 WARN L151 SmtUtils]: Spent 4906ms on a formula simplification. DAG size of input: 114 DAG size of output 86 [2018-04-11 20:49:35,391 WARN L151 SmtUtils]: Spent 2153ms on a formula simplification. DAG size of input: 115 DAG size of output 87 [2018-04-11 20:49:39,701 WARN L151 SmtUtils]: Spent 4086ms on a formula simplification. DAG size of input: 87 DAG size of output 71 [2018-04-11 20:49:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:49:40,121 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2018-04-11 20:49:40,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 20:49:40,122 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 41 [2018-04-11 20:49:40,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:49:40,123 INFO L225 Difference]: With dead ends: 106 [2018-04-11 20:49:40,123 INFO L226 Difference]: Without dead ends: 106 [2018-04-11 20:49:40,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=357, Invalid=3065, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 20:49:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-11 20:49:40,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2018-04-11 20:49:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 20:49:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-04-11 20:49:40,125 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 41 [2018-04-11 20:49:40,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:49:40,126 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-04-11 20:49:40,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 20:49:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-04-11 20:49:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 20:49:40,126 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:49:40,127 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 20:49:40,127 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:49:40,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1224572237, now seen corresponding path program 2 times [2018-04-11 20:49:40,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:49:40,127 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:49:40,128 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:49:40,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 20:49:40,128 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:49:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:49:40,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:49:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:49:40,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 20:49:40,398 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 20:49:40,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 20:49:40,424 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 20:49:40,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 20:49:40,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:49:40,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:49:40,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:40,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:49:40,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:40,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:40,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:49:40,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:49:40,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:49:40,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:49:40,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:40,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 20:49:40,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:40,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:40,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 20:49:40,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 20:49:40,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 20:49:40,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:40,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:40,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:40,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-11 20:49:40,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 20:49:40,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 20:49:40,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:40,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:40,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 20:49:40,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-04-11 20:49:40,725 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 32 treesize of output 30 [2018-04-11 20:49:40,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 20:49:40,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:49:40,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-11 20:49:40,751 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:40,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:49:40,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:49:40,763 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-04-11 20:49:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:49:40,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:49:40,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-04-11 20:49:40,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 20:49:40,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 20:49:40,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-04-11 20:49:40,833 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 24 states. [2018-04-11 20:49:43,402 WARN L151 SmtUtils]: Spent 2060ms on a formula simplification. DAG size of input: 70 DAG size of output 53 [2018-04-11 20:49:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:49:46,186 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-04-11 20:49:46,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 20:49:46,186 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-04-11 20:49:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:49:46,188 INFO L225 Difference]: With dead ends: 100 [2018-04-11 20:49:46,188 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 20:49:46,188 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 20:49:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 20:49:46,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 55. [2018-04-11 20:49:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 20:49:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-04-11 20:49:46,190 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 44 [2018-04-11 20:49:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:49:46,191 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-04-11 20:49:46,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 20:49:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-04-11 20:49:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 20:49:46,191 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:49:46,191 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 20:49:46,191 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:49:46,191 INFO L82 PathProgramCache]: Analyzing trace with hash 981065013, now seen corresponding path program 1 times [2018-04-11 20:49:46,191 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:49:46,191 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:49:46,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:49:46,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 20:49:46,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:49:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:49:46,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:49:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:49:46,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 20:49:46,537 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 20:49:46,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:49:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:49:46,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:49:46,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:49:46,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:46,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:49:46,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:46,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:46,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:49:46,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:49:46,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 20:49:46,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:46,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:49:46,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:49:46,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:49:46,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:46,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:46,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 20:49:46,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 20:49:46,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 20:49:46,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:46,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:46,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 20:49:46,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 20:49:46,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 20:49:46,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 20:49:46,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:46,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:49:46,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 20:49:46,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-04-11 20:49:49,170 WARN L148 SmtUtils]: Spent 2020ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-11 20:49:49,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 57 [2018-04-11 20:49:49,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-04-11 20:49:49,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:49,310 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 38 treesize of output 28 [2018-04-11 20:49:49,310 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:49,339 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 41 treesize of output 31 [2018-04-11 20:49:49,339 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:49,373 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 41 treesize of output 33 [2018-04-11 20:49:49,373 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 20:49:49,406 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 33 treesize of output 31 [2018-04-11 20:49:49,407 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 20:49:49,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-04-11 20:49:49,458 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-11 20:49:49,519 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2018-04-11 20:49:49,520 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-04-11 20:49:49,568 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 28 treesize of output 26 [2018-04-11 20:49:49,568 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 20:49:49,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-11 20:49:49,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:49:49,677 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:67, output treesize:96 [2018-04-11 20:49:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:49:49,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:49:49,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 37 [2018-04-11 20:49:49,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 20:49:49,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 20:49:49,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1297, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 20:49:49,838 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 38 states. [2018-04-11 20:49:50,788 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 89 DAG size of output 72 [2018-04-11 20:49:51,398 WARN L151 SmtUtils]: Spent 571ms on a formula simplification. DAG size of input: 89 DAG size of output 69 [2018-04-11 20:49:53,006 WARN L151 SmtUtils]: Spent 1553ms on a formula simplification. DAG size of input: 93 DAG size of output 73 [2018-04-11 20:49:53,245 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 110 DAG size of output 80 [2018-04-11 20:49:53,473 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 110 DAG size of output 81 [2018-04-11 20:49:53,770 WARN L151 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 82 DAG size of output 65 [2018-04-11 20:49:54,209 WARN L151 SmtUtils]: Spent 369ms on a formula simplification. DAG size of input: 77 DAG size of output 59 [2018-04-11 20:49:55,797 WARN L151 SmtUtils]: Spent 1206ms on a formula simplification. DAG size of input: 83 DAG size of output 65 [2018-04-11 20:49:55,998 WARN L151 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 90 DAG size of output 72 [2018-04-11 20:49:57,240 WARN L151 SmtUtils]: Spent 1099ms on a formula simplification. DAG size of input: 74 DAG size of output 60 [2018-04-11 20:49:59,912 WARN L151 SmtUtils]: Spent 2628ms on a formula simplification. DAG size of input: 90 DAG size of output 69 [2018-04-11 20:50:03,785 WARN L151 SmtUtils]: Spent 2531ms on a formula simplification. DAG size of input: 94 DAG size of output 73 [2018-04-11 20:50:04,062 WARN L151 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 111 DAG size of output 79 [2018-04-11 20:50:04,252 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 74 DAG size of output 60 [2018-04-11 20:50:04,508 WARN L151 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 111 DAG size of output 80 [2018-04-11 20:50:08,975 WARN L151 SmtUtils]: Spent 4423ms on a formula simplification. DAG size of input: 81 DAG size of output 67 [2018-04-11 20:50:09,557 WARN L151 SmtUtils]: Spent 361ms on a formula simplification. DAG size of input: 83 DAG size of output 65 [2018-04-11 20:50:09,956 WARN L151 SmtUtils]: Spent 277ms on a formula simplification. DAG size of input: 81 DAG size of output 64 [2018-04-11 20:50:10,391 WARN L151 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 85 DAG size of output 68 [2018-04-11 20:50:11,327 WARN L151 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 74 DAG size of output 59 [2018-04-11 20:50:11,888 WARN L151 SmtUtils]: Spent 454ms on a formula simplification. DAG size of input: 103 DAG size of output 76 [2018-04-11 20:50:12,951 WARN L151 SmtUtils]: Spent 370ms on a formula simplification. DAG size of input: 103 DAG size of output 77 [2018-04-11 20:50:13,759 WARN L151 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 76 DAG size of output 61 [2018-04-11 20:50:15,231 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 70 DAG size of output 55 [2018-04-11 20:50:16,101 WARN L151 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 76 DAG size of output 61 [2018-04-11 20:50:18,236 WARN L151 SmtUtils]: Spent 392ms on a formula simplification. DAG size of input: 83 DAG size of output 68 [2018-04-11 20:50:18,784 WARN L151 SmtUtils]: Spent 408ms on a formula simplification. DAG size of input: 83 DAG size of output 65 [2018-04-11 20:50:19,186 WARN L151 SmtUtils]: Spent 310ms on a formula simplification. DAG size of input: 87 DAG size of output 69 [2018-04-11 20:50:22,029 WARN L151 SmtUtils]: Spent 786ms on a formula simplification. DAG size of input: 104 DAG size of output 75 [2018-04-11 20:50:22,681 WARN L151 SmtUtils]: Spent 361ms on a formula simplification. DAG size of input: 104 DAG size of output 76 [2018-04-11 20:50:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:50:22,688 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-04-11 20:50:22,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 20:50:22,688 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 46 [2018-04-11 20:50:22,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:50:22,689 INFO L225 Difference]: With dead ends: 101 [2018-04-11 20:50:22,689 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 20:50:22,690 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=1137, Invalid=5341, Unknown=2, NotChecked=0, Total=6480 [2018-04-11 20:50:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 20:50:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-11 20:50:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 20:50:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-04-11 20:50:22,691 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2018-04-11 20:50:22,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:50:22,691 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-04-11 20:50:22,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 20:50:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-04-11 20:50:22,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 20:50:22,692 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:50:22,692 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:50:22,692 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:50:22,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1969827015, now seen corresponding path program 3 times [2018-04-11 20:50:22,692 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 20:50:22,693 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 20:50:22,693 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:50:22,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 20:50:22,693 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 20:50:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:50:22,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 20:50:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-11 20:50:22,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 20:50:22,932 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 20:50:22,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 20:50:22,962 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 20:50:22,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 20:50:22,964 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:50:22,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:50:22,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:50:22,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:50:22,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:50:22,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:50:22,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:50:23,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:50:23,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 20:50:23,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:50:23,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:50:23,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:50:23,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:50:23,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:50:23,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:50:23,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 20:50:23,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 20:50:23,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 20:50:23,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:50:23,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:50:23,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 20:50:23,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 20:50:23,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 20:50:23,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 20:50:23,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:50:23,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:50:23,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 20:50:23,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-04-11 20:50:24,590 WARN L148 SmtUtils]: Spent 816ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-11 20:50:24,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 57 [2018-04-11 20:50:24,867 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 45 treesize of output 43 [2018-04-11 20:50:24,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:50:24,907 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 35 treesize of output 27 [2018-04-11 20:50:24,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:50:24,908 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 29 treesize of output 21 [2018-04-11 20:50:24,909 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 20:50:24,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-04-11 20:50:24,941 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 20:50:24,970 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 38 treesize of output 28 [2018-04-11 20:50:24,970 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 20:50:25,003 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 28 treesize of output 26 [2018-04-11 20:50:25,003 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 20:50:25,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-04-11 20:50:25,036 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 20:50:25,076 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2018-04-11 20:50:25,076 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-11 20:50:25,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-11 20:50:25,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:50:25,190 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:67, output treesize:96 [2018-04-11 20:50:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 20:50:25,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:50:25,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-11 20:50:25,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 20:50:25,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 20:50:25,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 20:50:25,285 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 33 states. [2018-04-11 20:50:25,684 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 39 DAG size of output 35 [2018-04-11 20:50:25,939 WARN L151 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 51 DAG size of output 43 [2018-04-11 20:50:26,171 WARN L151 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-04-11 20:50:26,633 WARN L151 SmtUtils]: Spent 394ms on a formula simplification. DAG size of input: 64 DAG size of output 56 [2018-04-11 20:50:26,929 WARN L151 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 64 DAG size of output 52 [2018-04-11 20:50:27,417 WARN L151 SmtUtils]: Spent 424ms on a formula simplification. DAG size of input: 68 DAG size of output 56 [2018-04-11 20:50:27,779 WARN L151 SmtUtils]: Spent 296ms on a formula simplification. DAG size of input: 89 DAG size of output 68 [2018-04-11 20:50:28,419 WARN L151 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 89 DAG size of output 72 [2018-04-11 20:50:28,680 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 56 DAG size of output 48 [2018-04-11 20:50:28,910 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 62 DAG size of output 54 [2018-04-11 20:50:29,586 WARN L151 SmtUtils]: Spent 583ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-04-11 20:50:29,896 WARN L151 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 69 DAG size of output 57 [2018-04-11 20:50:30,219 WARN L151 SmtUtils]: Spent 246ms on a formula simplification. DAG size of input: 73 DAG size of output 61 [2018-04-11 20:50:32,902 WARN L151 SmtUtils]: Spent 2611ms on a formula simplification. DAG size of input: 90 DAG size of output 68 [2018-04-11 20:50:33,143 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 90 DAG size of output 71 [2018-04-11 20:50:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:50:33,164 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-04-11 20:50:33,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 20:50:33,164 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-04-11 20:50:33,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:50:33,165 INFO L225 Difference]: With dead ends: 49 [2018-04-11 20:50:33,165 INFO L226 Difference]: Without dead ends: 0 [2018-04-11 20:50:33,165 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=445, Invalid=2311, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 20:50:33,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-11 20:50:33,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-11 20:50:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-11 20:50:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-11 20:50:33,166 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-04-11 20:50:33,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:50:33,166 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-11 20:50:33,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 20:50:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-11 20:50:33,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-11 20:50:33,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 08:50:33 BoogieIcfgContainer [2018-04-11 20:50:33,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 20:50:33,170 INFO L168 Benchmark]: Toolchain (without parser) took 99670.96 ms. Allocated memory was 394.3 MB in the beginning and 780.7 MB in the end (delta: 386.4 MB). Free memory was 324.6 MB in the beginning and 610.1 MB in the end (delta: -285.5 MB). Peak memory consumption was 100.9 MB. Max. memory is 5.3 GB. [2018-04-11 20:50:33,171 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 394.3 MB. Free memory is still 352.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 20:50:33,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.67 ms. Allocated memory is still 394.3 MB. Free memory was 324.6 MB in the beginning and 300.1 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. [2018-04-11 20:50:33,171 INFO L168 Benchmark]: Boogie Preprocessor took 39.84 ms. Allocated memory is still 394.3 MB. Free memory was 300.1 MB in the beginning and 297.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 20:50:33,172 INFO L168 Benchmark]: RCFGBuilder took 406.33 ms. Allocated memory was 394.3 MB in the beginning and 609.7 MB in the end (delta: 215.5 MB). Free memory was 297.5 MB in the beginning and 541.7 MB in the end (delta: -244.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. [2018-04-11 20:50:33,172 INFO L168 Benchmark]: TraceAbstraction took 98998.92 ms. Allocated memory was 609.7 MB in the beginning and 780.7 MB in the end (delta: 170.9 MB). Free memory was 541.7 MB in the beginning and 610.1 MB in the end (delta: -68.4 MB). Peak memory consumption was 102.6 MB. Max. memory is 5.3 GB. [2018-04-11 20:50:33,173 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.20 ms. Allocated memory is still 394.3 MB. Free memory is still 352.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.67 ms. Allocated memory is still 394.3 MB. Free memory was 324.6 MB in the beginning and 300.1 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.84 ms. Allocated memory is still 394.3 MB. Free memory was 300.1 MB in the beginning and 297.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 406.33 ms. Allocated memory was 394.3 MB in the beginning and 609.7 MB in the end (delta: 215.5 MB). Free memory was 297.5 MB in the beginning and 541.7 MB in the end (delta: -244.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 98998.92 ms. Allocated memory was 609.7 MB in the beginning and 780.7 MB in the end (delta: 170.9 MB). Free memory was 541.7 MB in the beginning and 610.1 MB in the end (delta: -68.4 MB). Peak memory consumption was 102.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 15 error locations. SAFE Result, 98.9s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 84.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 857 SDtfs, 2573 SDslu, 4180 SDs, 0 SdLazy, 5672 SolverSat, 443 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 810 GetRequests, 291 SyntacticMatches, 3 SemanticMatches, 516 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3642 ImplicationChecksByTransitivity, 82.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=18, 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.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 302 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 1049 NumberOfCodeBlocks, 1049 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1015 ConstructedInterpolants, 128 QuantifiedInterpolants, 489220 SizeOfPredicates, 124 NumberOfNonLiveVariables, 1579 ConjunctsInSsa, 316 ConjunctsInUnsatCore, 34 InterpolantComputations, 16 PerfectInterpolantSequences, 48/276 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_20-50-33-178.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_20-50-33-178.csv Received shutdown request...